./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-numeric/Binomial.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 574ddb4e 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/AutomizerReach.xml -i ../sv-benchmarks/c/termination-numeric/Binomial.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c204b56aba09d3ce87e17edffdff1d33aa0b4dc87a1e1140339548dffa982588 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-18 23:33:40,405 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 23:33:40,407 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 23:33:40,430 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 23:33:40,431 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 23:33:40,432 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 23:33:40,433 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 23:33:40,434 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 23:33:40,435 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 23:33:40,436 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 23:33:40,436 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 23:33:40,437 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 23:33:40,437 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 23:33:40,438 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 23:33:40,439 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 23:33:40,440 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 23:33:40,440 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 23:33:40,441 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 23:33:40,442 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 23:33:40,443 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 23:33:40,444 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 23:33:40,445 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 23:33:40,446 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 23:33:40,446 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 23:33:40,449 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 23:33:40,449 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 23:33:40,449 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 23:33:40,450 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 23:33:40,450 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 23:33:40,451 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 23:33:40,451 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 23:33:40,452 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 23:33:40,452 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 23:33:40,453 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 23:33:40,454 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 23:33:40,454 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 23:33:40,454 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 23:33:40,455 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 23:33:40,455 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 23:33:40,456 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 23:33:40,456 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 23:33:40,457 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2023-02-18 23:33:40,472 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 23:33:40,473 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 23:33:40,473 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 23:33:40,473 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 23:33:40,474 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 23:33:40,474 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 23:33:40,474 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 23:33:40,474 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 23:33:40,475 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 23:33:40,475 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 23:33:40,475 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-18 23:33:40,475 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 23:33:40,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 23:33:40,476 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 23:33:40,476 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 23:33:40,476 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 23:33:40,476 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-18 23:33:40,476 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 23:33:40,476 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 23:33:40,477 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 23:33:40,477 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 23:33:40,477 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 23:33:40,477 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 23:33:40,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 23:33:40,478 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 23:33:40,478 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 23:33:40,478 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 23:33:40,478 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 23:33:40,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 23:33:40,478 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 23:33:40,479 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 23:33:40,479 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 23:33:40,479 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 23:33:40,479 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 23:33:40,479 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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(G ! overflow) ) 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-18 23:33:40,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 23:33:40,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 23:33:40,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 23:33:40,679 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 23:33:40,679 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 23:33:40,680 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-18 23:33:41,760 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 23:33:41,945 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 23:33:41,945 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Binomial.c [2023-02-18 23:33:41,949 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9d892c06/12c3116c7f684e49932b4c0fde93f1ef/FLAGd008dbd9d [2023-02-18 23:33:41,960 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9d892c06/12c3116c7f684e49932b4c0fde93f1ef [2023-02-18 23:33:41,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 23:33:41,963 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 23:33:41,964 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 23:33:41,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 23:33:41,966 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 23:33:41,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 11:33:41" (1/1) ... [2023-02-18 23:33:41,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c067d53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:33:41, skipping insertion in model container [2023-02-18 23:33:41,968 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 11:33:41" (1/1) ... [2023-02-18 23:33:41,972 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 23:33:41,981 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 23:33:42,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 23:33:42,111 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 23:33:42,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 23:33:42,133 INFO L208 MainTranslator]: Completed translation [2023-02-18 23:33:42,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:33:42 WrapperNode [2023-02-18 23:33:42,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 23:33:42,134 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 23:33:42,134 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 23:33:42,134 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 23:33:42,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:33:42" (1/1) ... [2023-02-18 23:33:42,142 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:33:42" (1/1) ... [2023-02-18 23:33:42,152 INFO L138 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 44 [2023-02-18 23:33:42,152 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 23:33:42,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 23:33:42,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 23:33:42,153 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 23:33:42,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:33:42" (1/1) ... [2023-02-18 23:33:42,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:33:42" (1/1) ... [2023-02-18 23:33:42,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:33:42" (1/1) ... [2023-02-18 23:33:42,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:33:42" (1/1) ... [2023-02-18 23:33:42,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:33:42" (1/1) ... [2023-02-18 23:33:42,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:33:42" (1/1) ... [2023-02-18 23:33:42,169 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:33:42" (1/1) ... [2023-02-18 23:33:42,169 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:33:42" (1/1) ... [2023-02-18 23:33:42,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 23:33:42,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 23:33:42,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 23:33:42,171 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 23:33:42,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:33:42" (1/1) ... [2023-02-18 23:33:42,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 23:33:42,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:33:42,197 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-18 23:33:42,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-18 23:33:42,228 INFO L130 BoogieDeclarations]: Found specification of procedure fact [2023-02-18 23:33:42,228 INFO L138 BoogieDeclarations]: Found implementation of procedure fact [2023-02-18 23:33:42,228 INFO L130 BoogieDeclarations]: Found specification of procedure binomialCoefficient [2023-02-18 23:33:42,229 INFO L138 BoogieDeclarations]: Found implementation of procedure binomialCoefficient [2023-02-18 23:33:42,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 23:33:42,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 23:33:42,267 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 23:33:42,268 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 23:33:42,414 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 23:33:42,419 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 23:33:42,419 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-18 23:33:42,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 11:33:42 BoogieIcfgContainer [2023-02-18 23:33:42,421 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 23:33:42,422 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 23:33:42,422 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 23:33:42,424 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 23:33:42,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 11:33:41" (1/3) ... [2023-02-18 23:33:42,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca707bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 11:33:42, skipping insertion in model container [2023-02-18 23:33:42,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:33:42" (2/3) ... [2023-02-18 23:33:42,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca707bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 11:33:42, skipping insertion in model container [2023-02-18 23:33:42,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 11:33:42" (3/3) ... [2023-02-18 23:33:42,427 INFO L112 eAbstractionObserver]: Analyzing ICFG Binomial.c [2023-02-18 23:33:42,452 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 23:33:42,453 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-02-18 23:33:42,514 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 23:33:42,519 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5491105b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 23:33:42,528 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2023-02-18 23:33:42,533 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 50 states have internal predecessors, (58), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-18 23:33:42,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-18 23:33:42,537 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:33:42,538 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:33:42,538 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:33:42,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:33:42,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1446708258, now seen corresponding path program 1 times [2023-02-18 23:33:42,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:33:42,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095564935] [2023-02-18 23:33:42,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:42,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:33:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:42,701 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-18 23:33:42,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:33:42,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095564935] [2023-02-18 23:33:42,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095564935] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:33:42,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:33:42,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 23:33:42,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533068353] [2023-02-18 23:33:42,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:33:42,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 23:33:42,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:33:42,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 23:33:42,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 23:33:42,742 INFO L87 Difference]: Start difference. First operand has 59 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 50 states have internal predecessors, (58), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-18 23:33:42,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:33:42,767 INFO L93 Difference]: Finished difference Result 114 states and 134 transitions. [2023-02-18 23:33:42,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 23:33:42,770 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) Word has length 8 [2023-02-18 23:33:42,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:33:42,777 INFO L225 Difference]: With dead ends: 114 [2023-02-18 23:33:42,778 INFO L226 Difference]: Without dead ends: 56 [2023-02-18 23:33:42,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 23:33:42,787 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 23:33:42,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 23:33:42,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-02-18 23:33:42,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-02-18 23:33:42,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.5) internal successors, (51), 47 states have internal predecessors, (51), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-18 23:33:42,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2023-02-18 23:33:42,815 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 8 [2023-02-18 23:33:42,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:33:42,816 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2023-02-18 23:33:42,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-18 23:33:42,816 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2023-02-18 23:33:42,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-18 23:33:42,817 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:33:42,817 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:33:42,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 23:33:42,817 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:33:42,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:33:42,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1446689999, now seen corresponding path program 1 times [2023-02-18 23:33:42,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:33:42,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696208992] [2023-02-18 23:33:42,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:42,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:33:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:42,856 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-18 23:33:42,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:33:42,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696208992] [2023-02-18 23:33:42,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696208992] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:33:42,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:33:42,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 23:33:42,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469504787] [2023-02-18 23:33:42,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:33:42,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 23:33:42,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:33:42,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 23:33:42,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 23:33:42,859 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-18 23:33:42,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:33:42,897 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2023-02-18 23:33:42,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 23:33:42,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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) Word has length 8 [2023-02-18 23:33:42,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:33:42,898 INFO L225 Difference]: With dead ends: 109 [2023-02-18 23:33:42,898 INFO L226 Difference]: Without dead ends: 57 [2023-02-18 23:33:42,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 23:33:42,900 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 27 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 23:33:42,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 141 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 23:33:42,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-02-18 23:33:42,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-02-18 23:33:42,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 48 states have internal predecessors, (52), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-18 23:33:42,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2023-02-18 23:33:42,907 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 8 [2023-02-18 23:33:42,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:33:42,907 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2023-02-18 23:33:42,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-18 23:33:42,908 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2023-02-18 23:33:42,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-18 23:33:42,908 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:33:42,908 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:33:42,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 23:33:42,909 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:33:42,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:33:42,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1304665248, now seen corresponding path program 1 times [2023-02-18 23:33:42,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:33:42,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524304874] [2023-02-18 23:33:42,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:42,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:33:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:42,940 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-18 23:33:42,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:33:42,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524304874] [2023-02-18 23:33:42,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524304874] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:33:42,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:33:42,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 23:33:42,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342482938] [2023-02-18 23:33:42,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:33:42,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 23:33:42,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:33:42,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 23:33:42,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 23:33:42,942 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 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-18 23:33:42,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:33:42,967 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2023-02-18 23:33:42,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 23:33:42,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-18 23:33:42,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:33:42,970 INFO L225 Difference]: With dead ends: 59 [2023-02-18 23:33:42,970 INFO L226 Difference]: Without dead ends: 58 [2023-02-18 23:33:42,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 23:33:42,972 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 9 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 23:33:42,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 111 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 23:33:42,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-02-18 23:33:42,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2023-02-18 23:33:42,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.457142857142857) internal successors, (51), 47 states have internal predecessors, (51), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-18 23:33:42,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2023-02-18 23:33:42,981 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 13 [2023-02-18 23:33:42,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:33:42,981 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2023-02-18 23:33:42,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 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-18 23:33:42,982 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2023-02-18 23:33:42,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-18 23:33:42,982 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:33:42,983 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:33:42,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-18 23:33:42,983 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:33:42,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:33:42,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1789917062, now seen corresponding path program 1 times [2023-02-18 23:33:42,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:33:42,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964760469] [2023-02-18 23:33:42,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:42,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:33:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:43,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 23:33:43,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:33:43,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964760469] [2023-02-18 23:33:43,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964760469] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:33:43,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:33:43,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 23:33:43,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644518220] [2023-02-18 23:33:43,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:33:43,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 23:33:43,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:33:43,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 23:33:43,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-18 23:33:43,081 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-18 23:33:43,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:33:43,176 INFO L93 Difference]: Finished difference Result 153 states and 180 transitions. [2023-02-18 23:33:43,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 23:33:43,176 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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) Word has length 14 [2023-02-18 23:33:43,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:33:43,178 INFO L225 Difference]: With dead ends: 153 [2023-02-18 23:33:43,178 INFO L226 Difference]: Without dead ends: 101 [2023-02-18 23:33:43,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-18 23:33:43,180 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 52 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:33:43,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 348 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:33:43,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-02-18 23:33:43,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 86. [2023-02-18 23:33:43,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 70 states have internal predecessors, (84), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-18 23:33:43,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 106 transitions. [2023-02-18 23:33:43,193 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 106 transitions. Word has length 14 [2023-02-18 23:33:43,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:33:43,193 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 106 transitions. [2023-02-18 23:33:43,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-18 23:33:43,194 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 106 transitions. [2023-02-18 23:33:43,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-18 23:33:43,194 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:33:43,195 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:33:43,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-18 23:33:43,195 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:33:43,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:33:43,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1946231172, now seen corresponding path program 1 times [2023-02-18 23:33:43,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:33:43,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68893428] [2023-02-18 23:33:43,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:43,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:33:43,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:43,242 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-18 23:33:43,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:33:43,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68893428] [2023-02-18 23:33:43,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68893428] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:33:43,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:33:43,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 23:33:43,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712613628] [2023-02-18 23:33:43,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:33:43,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 23:33:43,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:33:43,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 23:33:43,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 23:33:43,245 INFO L87 Difference]: Start difference. First operand 86 states and 106 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 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-18 23:33:43,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:33:43,295 INFO L93 Difference]: Finished difference Result 184 states and 223 transitions. [2023-02-18 23:33:43,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 23:33:43,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-18 23:33:43,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:33:43,297 INFO L225 Difference]: With dead ends: 184 [2023-02-18 23:33:43,297 INFO L226 Difference]: Without dead ends: 104 [2023-02-18 23:33:43,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 23:33:43,299 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 34 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 23:33:43,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 166 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 23:33:43,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-18 23:33:43,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 87. [2023-02-18 23:33:43,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 71 states have internal predecessors, (85), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-18 23:33:43,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 107 transitions. [2023-02-18 23:33:43,307 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 107 transitions. Word has length 14 [2023-02-18 23:33:43,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:33:43,308 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 107 transitions. [2023-02-18 23:33:43,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 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-18 23:33:43,308 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 107 transitions. [2023-02-18 23:33:43,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-18 23:33:43,308 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:33:43,309 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:33:43,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-18 23:33:43,309 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:33:43,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:33:43,310 INFO L85 PathProgramCache]: Analyzing trace with hash -639849399, now seen corresponding path program 1 times [2023-02-18 23:33:43,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:33:43,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759004394] [2023-02-18 23:33:43,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:43,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:33:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:43,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 23:33:43,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:43,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 23:33:43,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:33:43,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759004394] [2023-02-18 23:33:43,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759004394] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:33:43,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:33:43,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 23:33:43,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481403652] [2023-02-18 23:33:43,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:33:43,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 23:33:43,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:33:43,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 23:33:43,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-18 23:33:43,383 INFO L87 Difference]: Start difference. First operand 87 states and 107 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 23:33:43,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:33:43,470 INFO L93 Difference]: Finished difference Result 224 states and 292 transitions. [2023-02-18 23:33:43,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 23:33:43,470 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-02-18 23:33:43,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:33:43,472 INFO L225 Difference]: With dead ends: 224 [2023-02-18 23:33:43,472 INFO L226 Difference]: Without dead ends: 144 [2023-02-18 23:33:43,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-18 23:33:43,482 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 43 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:33:43,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 304 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:33:43,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-02-18 23:33:43,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 124. [2023-02-18 23:33:43,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 99 states have internal predecessors, (124), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2023-02-18 23:33:43,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 162 transitions. [2023-02-18 23:33:43,503 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 162 transitions. Word has length 20 [2023-02-18 23:33:43,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:33:43,503 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 162 transitions. [2023-02-18 23:33:43,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 23:33:43,504 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 162 transitions. [2023-02-18 23:33:43,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-18 23:33:43,504 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:33:43,504 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:33:43,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-18 23:33:43,504 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting binomialCoefficientErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:33:43,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:33:43,505 INFO L85 PathProgramCache]: Analyzing trace with hash -715516421, now seen corresponding path program 1 times [2023-02-18 23:33:43,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:33:43,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716078341] [2023-02-18 23:33:43,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:43,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:33:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:43,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 23:33:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:43,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 23:33:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:43,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 23:33:43,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:33:43,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716078341] [2023-02-18 23:33:43,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716078341] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:33:43,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:33:43,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 23:33:43,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858861134] [2023-02-18 23:33:43,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:33:43,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 23:33:43,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:33:43,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 23:33:43,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-18 23:33:43,597 INFO L87 Difference]: Start difference. First operand 124 states and 162 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 23:33:43,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:33:43,665 INFO L93 Difference]: Finished difference Result 162 states and 200 transitions. [2023-02-18 23:33:43,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 23:33:43,666 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-02-18 23:33:43,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:33:43,668 INFO L225 Difference]: With dead ends: 162 [2023-02-18 23:33:43,669 INFO L226 Difference]: Without dead ends: 161 [2023-02-18 23:33:43,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-18 23:33:43,670 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 62 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:33:43,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 248 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:33:43,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-02-18 23:33:43,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 139. [2023-02-18 23:33:43,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 96 states have (on average 1.4270833333333333) internal successors, (137), 110 states have internal predecessors, (137), 22 states have call successors, (22), 8 states have call predecessors, (22), 8 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-18 23:33:43,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 181 transitions. [2023-02-18 23:33:43,682 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 181 transitions. Word has length 22 [2023-02-18 23:33:43,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:33:43,683 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 181 transitions. [2023-02-18 23:33:43,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 23:33:43,683 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 181 transitions. [2023-02-18 23:33:43,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-18 23:33:43,683 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:33:43,683 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:33:43,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-18 23:33:43,684 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting binomialCoefficientErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:33:43,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:33:43,684 INFO L85 PathProgramCache]: Analyzing trace with hash -706172517, now seen corresponding path program 1 times [2023-02-18 23:33:43,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:33:43,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380731880] [2023-02-18 23:33:43,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:43,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:33:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:43,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 23:33:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:43,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 23:33:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:43,747 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 23:33:43,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:33:43,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380731880] [2023-02-18 23:33:43,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380731880] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:33:43,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:33:43,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 23:33:43,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966171304] [2023-02-18 23:33:43,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:33:43,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 23:33:43,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:33:43,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 23:33:43,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-18 23:33:43,748 INFO L87 Difference]: Start difference. First operand 139 states and 181 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 23:33:43,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:33:43,817 INFO L93 Difference]: Finished difference Result 162 states and 197 transitions. [2023-02-18 23:33:43,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 23:33:43,819 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2023-02-18 23:33:43,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:33:43,821 INFO L225 Difference]: With dead ends: 162 [2023-02-18 23:33:43,821 INFO L226 Difference]: Without dead ends: 161 [2023-02-18 23:33:43,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-18 23:33:43,822 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 60 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:33:43,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 262 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:33:43,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-02-18 23:33:43,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 139. [2023-02-18 23:33:43,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 96 states have (on average 1.4166666666666667) internal successors, (136), 110 states have internal predecessors, (136), 22 states have call successors, (22), 8 states have call predecessors, (22), 8 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-18 23:33:43,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 180 transitions. [2023-02-18 23:33:43,837 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 180 transitions. Word has length 23 [2023-02-18 23:33:43,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:33:43,837 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 180 transitions. [2023-02-18 23:33:43,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 23:33:43,837 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 180 transitions. [2023-02-18 23:33:43,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-18 23:33:43,838 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:33:43,838 INFO L195 NwaCegarLoop]: trace histogram [3, 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-18 23:33:43,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-18 23:33:43,838 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:33:43,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:33:43,838 INFO L85 PathProgramCache]: Analyzing trace with hash 230694540, now seen corresponding path program 1 times [2023-02-18 23:33:43,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:33:43,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521143757] [2023-02-18 23:33:43,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:43,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:33:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:43,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 23:33:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:43,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 23:33:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:43,912 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 23:33:43,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:33:43,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521143757] [2023-02-18 23:33:43,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521143757] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:33:43,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:33:43,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 23:33:43,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507955302] [2023-02-18 23:33:43,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:33:43,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 23:33:43,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:33:43,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 23:33:43,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-18 23:33:43,933 INFO L87 Difference]: Start difference. First operand 139 states and 180 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 23:33:44,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:33:44,025 INFO L93 Difference]: Finished difference Result 290 states and 374 transitions. [2023-02-18 23:33:44,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 23:33:44,025 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2023-02-18 23:33:44,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:33:44,027 INFO L225 Difference]: With dead ends: 290 [2023-02-18 23:33:44,027 INFO L226 Difference]: Without dead ends: 167 [2023-02-18 23:33:44,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-18 23:33:44,029 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 64 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:33:44,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 340 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:33:44,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-02-18 23:33:44,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 143. [2023-02-18 23:33:44,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 99 states have (on average 1.404040404040404) internal successors, (139), 113 states have internal predecessors, (139), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-18 23:33:44,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 183 transitions. [2023-02-18 23:33:44,042 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 183 transitions. Word has length 28 [2023-02-18 23:33:44,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:33:44,043 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 183 transitions. [2023-02-18 23:33:44,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 23:33:44,043 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 183 transitions. [2023-02-18 23:33:44,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-18 23:33:44,044 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:33:44,044 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:33:44,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-18 23:33:44,045 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting binomialCoefficientErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:33:44,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:33:44,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1641411648, now seen corresponding path program 1 times [2023-02-18 23:33:44,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:33:44,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932989595] [2023-02-18 23:33:44,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:44,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:33:44,058 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:33:44,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1433810784] [2023-02-18 23:33:44,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:44,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:44,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:33:44,061 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:33:44,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-18 23:33:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:44,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 23:33:44,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:33:44,173 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-18 23:33:44,173 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 23:33:44,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:33:44,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932989595] [2023-02-18 23:33:44,174 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:33:44,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433810784] [2023-02-18 23:33:44,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433810784] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:33:44,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:33:44,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 23:33:44,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949704893] [2023-02-18 23:33:44,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:33:44,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 23:33:44,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:33:44,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 23:33:44,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-18 23:33:44,176 INFO L87 Difference]: Start difference. First operand 143 states and 183 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-18 23:33:44,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:33:44,222 INFO L93 Difference]: Finished difference Result 201 states and 280 transitions. [2023-02-18 23:33:44,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 23:33:44,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2023-02-18 23:33:44,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:33:44,224 INFO L225 Difference]: With dead ends: 201 [2023-02-18 23:33:44,224 INFO L226 Difference]: Without dead ends: 200 [2023-02-18 23:33:44,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-18 23:33:44,225 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 15 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 23:33:44,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 202 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 23:33:44,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-02-18 23:33:44,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 165. [2023-02-18 23:33:44,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 117 states have (on average 1.3675213675213675) internal successors, (160), 128 states have internal predecessors, (160), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (39), 27 states have call predecessors, (39), 25 states have call successors, (39) [2023-02-18 23:33:44,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 224 transitions. [2023-02-18 23:33:44,236 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 224 transitions. Word has length 30 [2023-02-18 23:33:44,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:33:44,236 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 224 transitions. [2023-02-18 23:33:44,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-18 23:33:44,236 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 224 transitions. [2023-02-18 23:33:44,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-18 23:33:44,241 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:33:44,242 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:33:44,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-18 23:33:44,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-18 23:33:44,447 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting binomialCoefficientErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:33:44,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:33:44,451 INFO L85 PathProgramCache]: Analyzing trace with hash 655846524, now seen corresponding path program 1 times [2023-02-18 23:33:44,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:33:44,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397708421] [2023-02-18 23:33:44,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:44,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:33:44,457 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:33:44,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1835270058] [2023-02-18 23:33:44,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:44,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:44,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:33:44,464 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:33:44,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-18 23:33:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:44,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-18 23:33:44,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:33:44,505 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-18 23:33:44,505 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 23:33:44,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:33:44,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397708421] [2023-02-18 23:33:44,506 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:33:44,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835270058] [2023-02-18 23:33:44,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835270058] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:33:44,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:33:44,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 23:33:44,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257502357] [2023-02-18 23:33:44,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:33:44,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 23:33:44,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:33:44,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 23:33:44,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-18 23:33:44,507 INFO L87 Difference]: Start difference. First operand 165 states and 224 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-18 23:33:44,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:33:44,545 INFO L93 Difference]: Finished difference Result 201 states and 275 transitions. [2023-02-18 23:33:44,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 23:33:44,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2023-02-18 23:33:44,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:33:44,546 INFO L225 Difference]: With dead ends: 201 [2023-02-18 23:33:44,546 INFO L226 Difference]: Without dead ends: 200 [2023-02-18 23:33:44,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-18 23:33:44,547 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 18 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 23:33:44,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 156 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 23:33:44,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-02-18 23:33:44,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 169. [2023-02-18 23:33:44,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 121 states have (on average 1.3471074380165289) internal successors, (163), 132 states have internal predecessors, (163), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (39), 27 states have call predecessors, (39), 25 states have call successors, (39) [2023-02-18 23:33:44,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 227 transitions. [2023-02-18 23:33:44,554 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 227 transitions. Word has length 31 [2023-02-18 23:33:44,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:33:44,554 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 227 transitions. [2023-02-18 23:33:44,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-18 23:33:44,554 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 227 transitions. [2023-02-18 23:33:44,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-18 23:33:44,555 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:33:44,555 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:33:44,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-18 23:33:44,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-18 23:33:44,759 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting binomialCoefficientErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:33:44,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:33:44,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1143594174, now seen corresponding path program 1 times [2023-02-18 23:33:44,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:33:44,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017769210] [2023-02-18 23:33:44,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:44,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:33:44,765 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:33:44,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [708249371] [2023-02-18 23:33:44,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:44,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:44,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:33:44,779 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:33:44,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-18 23:33:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:44,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 23:33:44,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:33:44,838 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 23:33:44,838 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 23:33:44,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:33:44,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017769210] [2023-02-18 23:33:44,838 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:33:44,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708249371] [2023-02-18 23:33:44,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708249371] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:33:44,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:33:44,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 23:33:44,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749411930] [2023-02-18 23:33:44,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:33:44,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 23:33:44,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:33:44,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 23:33:44,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-18 23:33:44,840 INFO L87 Difference]: Start difference. First operand 169 states and 227 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 23:33:44,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:33:44,922 INFO L93 Difference]: Finished difference Result 256 states and 354 transitions. [2023-02-18 23:33:44,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 23:33:44,923 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2023-02-18 23:33:44,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:33:44,924 INFO L225 Difference]: With dead ends: 256 [2023-02-18 23:33:44,924 INFO L226 Difference]: Without dead ends: 255 [2023-02-18 23:33:44,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-18 23:33:44,925 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 25 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:33:44,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 265 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:33:44,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2023-02-18 23:33:44,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 200. [2023-02-18 23:33:44,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 146 states have (on average 1.3082191780821917) internal successors, (191), 154 states have internal predecessors, (191), 31 states have call successors, (31), 9 states have call predecessors, (31), 10 states have return successors, (50), 36 states have call predecessors, (50), 31 states have call successors, (50) [2023-02-18 23:33:44,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 272 transitions. [2023-02-18 23:33:44,933 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 272 transitions. Word has length 32 [2023-02-18 23:33:44,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:33:44,934 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 272 transitions. [2023-02-18 23:33:44,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 23:33:44,934 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 272 transitions. [2023-02-18 23:33:44,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-18 23:33:44,934 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:33:44,934 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:33:44,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-18 23:33:45,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:45,139 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting binomialCoefficientErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:33:45,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:33:45,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1091680962, now seen corresponding path program 1 times [2023-02-18 23:33:45,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:33:45,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11874044] [2023-02-18 23:33:45,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:45,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:33:45,144 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:33:45,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [537516906] [2023-02-18 23:33:45,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:45,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:45,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:33:45,145 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:33:45,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-18 23:33:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:45,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-18 23:33:45,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:33:45,197 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-18 23:33:45,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:33:47,341 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (< |c_binomialCoefficient_#t~ret1| 0))) (let ((.cse4 (forall ((|v_binomialCoefficient_#t~ret3_14| Int)) (or (< |v_binomialCoefficient_#t~ret3_14| 1) (not (= 0 (mod |c_binomialCoefficient_#t~ret1| (* |c_binomialCoefficient_#t~ret2| |v_binomialCoefficient_#t~ret3_14|)))) (<= (div |c_binomialCoefficient_#t~ret1| (* |v_binomialCoefficient_#t~ret3_14| |c_binomialCoefficient_#t~ret2|)) 2147483647)))) (.cse13 (forall ((|v_binomialCoefficient_#t~ret3_14| Int)) (let ((.cse23 (div |c_binomialCoefficient_#t~ret1| (* |v_binomialCoefficient_#t~ret3_14| |c_binomialCoefficient_#t~ret2|)))) (or (< |v_binomialCoefficient_#t~ret3_14| 1) (= 0 (mod |c_binomialCoefficient_#t~ret1| (* |c_binomialCoefficient_#t~ret2| |v_binomialCoefficient_#t~ret3_14|))) (<= (+ 1 .cse23) 2147483647) (<= (+ .cse23 (- 1)) 2147483647) (<= .cse23 2147483647))))) (.cse14 (or .cse3 (forall ((|v_binomialCoefficient_#t~ret3_14| Int)) (let ((.cse22 (div |c_binomialCoefficient_#t~ret1| (* |v_binomialCoefficient_#t~ret3_14| |c_binomialCoefficient_#t~ret2|)))) (or (< |v_binomialCoefficient_#t~ret3_14| 1) (= 0 (mod |c_binomialCoefficient_#t~ret1| (* |c_binomialCoefficient_#t~ret2| |v_binomialCoefficient_#t~ret3_14|))) (<= (+ .cse22 (- 1)) 2147483647) (<= .cse22 2147483647)))))) (.cse15 (or .cse3 (forall ((|v_binomialCoefficient_#t~ret3_14| Int)) (or (< |v_binomialCoefficient_#t~ret3_14| 1) (= 0 (mod |c_binomialCoefficient_#t~ret1| (* |c_binomialCoefficient_#t~ret2| |v_binomialCoefficient_#t~ret3_14|))) (<= (div |c_binomialCoefficient_#t~ret1| (* |v_binomialCoefficient_#t~ret3_14| |c_binomialCoefficient_#t~ret2|)) 2147483647))))) (.cse16 (forall ((|v_binomialCoefficient_#t~ret3_14| Int)) (let ((.cse21 (div |c_binomialCoefficient_#t~ret1| (* |v_binomialCoefficient_#t~ret3_14| |c_binomialCoefficient_#t~ret2|)))) (or (< |v_binomialCoefficient_#t~ret3_14| 1) (= 0 (mod |c_binomialCoefficient_#t~ret1| (* |c_binomialCoefficient_#t~ret2| |v_binomialCoefficient_#t~ret3_14|))) (<= (+ 1 .cse21) 2147483647) (<= .cse21 2147483647))))) (.cse9 (not .cse3))) (and (forall ((|v_binomialCoefficient_#t~ret3_14| Int)) (let ((.cse0 (div |c_binomialCoefficient_#t~ret1| (* |v_binomialCoefficient_#t~ret3_14| |c_binomialCoefficient_#t~ret2|)))) (or (< |v_binomialCoefficient_#t~ret3_14| 1) (<= (+ 1 .cse0) 2147483647) (not (= 0 (mod |c_binomialCoefficient_#t~ret1| (* |c_binomialCoefficient_#t~ret2| |v_binomialCoefficient_#t~ret3_14|)))) (<= .cse0 2147483647)))) (forall ((|v_binomialCoefficient_#t~ret3_14| Int)) (let ((.cse1 (div |c_binomialCoefficient_#t~ret1| (* |v_binomialCoefficient_#t~ret3_14| |c_binomialCoefficient_#t~ret2|)))) (or (< |v_binomialCoefficient_#t~ret3_14| 1) (<= (+ 1 .cse1) 2147483647) (<= (+ .cse1 (- 1)) 2147483647) (<= .cse1 2147483647)))) (or (forall ((|v_binomialCoefficient_#t~ret3_14| Int)) (let ((.cse2 (div |c_binomialCoefficient_#t~ret1| (* |v_binomialCoefficient_#t~ret3_14| |c_binomialCoefficient_#t~ret2|)))) (or (< |v_binomialCoefficient_#t~ret3_14| 1) (<= (+ .cse2 (- 1)) 2147483647) (<= .cse2 2147483647)))) .cse3) (or .cse4 .cse3) (forall ((|v_binomialCoefficient_#t~ret3_14| Int)) (let ((.cse5 (div |c_binomialCoefficient_#t~ret1| (* |v_binomialCoefficient_#t~ret3_14| |c_binomialCoefficient_#t~ret2|)))) (or (< |v_binomialCoefficient_#t~ret3_14| 1) (not (< (* |c_binomialCoefficient_#t~ret2| |v_binomialCoefficient_#t~ret3_14|) 0)) (<= (+ .cse5 (- 1)) 2147483647) (<= .cse5 2147483647)))) (forall ((|v_binomialCoefficient_#t~ret3_14| Int)) (let ((.cse6 (div |c_binomialCoefficient_#t~ret1| (* |v_binomialCoefficient_#t~ret3_14| |c_binomialCoefficient_#t~ret2|)))) (or (< |v_binomialCoefficient_#t~ret3_14| 1) (<= (+ 1 .cse6) 2147483647) (< (* |c_binomialCoefficient_#t~ret2| |v_binomialCoefficient_#t~ret3_14|) 0) (<= .cse6 2147483647)))) .cse4 (or (and (or (forall ((|v_binomialCoefficient_#t~ret3_14| Int)) (let ((.cse7 (* |c_binomialCoefficient_#t~ret2| |v_binomialCoefficient_#t~ret3_14|))) (or (< |v_binomialCoefficient_#t~ret3_14| 1) (= 0 (mod |c_binomialCoefficient_#t~ret1| .cse7)) (< .cse7 0)))) .cse3) (forall ((|v_binomialCoefficient_#t~ret3_14| Int)) (let ((.cse8 (* |c_binomialCoefficient_#t~ret2| |v_binomialCoefficient_#t~ret3_14|))) (or (< |v_binomialCoefficient_#t~ret3_14| 1) (= 0 (mod |c_binomialCoefficient_#t~ret1| .cse8)) (<= (+ 1 (div |c_binomialCoefficient_#t~ret1| (* |v_binomialCoefficient_#t~ret3_14| |c_binomialCoefficient_#t~ret2|))) 2147483647) (< .cse8 0))))) .cse9) (forall ((|v_binomialCoefficient_#t~ret3_14| Int)) (let ((.cse10 (* |c_binomialCoefficient_#t~ret2| |v_binomialCoefficient_#t~ret3_14|))) (or (< |v_binomialCoefficient_#t~ret3_14| 1) (not (= 0 (mod |c_binomialCoefficient_#t~ret1| .cse10))) (< .cse10 0) (<= (div |c_binomialCoefficient_#t~ret1| (* |v_binomialCoefficient_#t~ret3_14| |c_binomialCoefficient_#t~ret2|)) 2147483647)))) (forall ((|v_binomialCoefficient_#t~ret3_14| Int)) (let ((.cse11 (* |c_binomialCoefficient_#t~ret2| |v_binomialCoefficient_#t~ret3_14|))) (or (< |v_binomialCoefficient_#t~ret3_14| 1) (not (< .cse11 0)) (not (= 0 (mod |c_binomialCoefficient_#t~ret1| .cse11))) (<= (div |c_binomialCoefficient_#t~ret1| (* |v_binomialCoefficient_#t~ret3_14| |c_binomialCoefficient_#t~ret2|)) 2147483647)))) (or (forall ((|v_binomialCoefficient_#t~ret3_14| Int)) (or (< |v_binomialCoefficient_#t~ret3_14| 1) (< (* |c_binomialCoefficient_#t~ret2| |v_binomialCoefficient_#t~ret3_14|) 0) (<= (div |c_binomialCoefficient_#t~ret1| (* |v_binomialCoefficient_#t~ret3_14| |c_binomialCoefficient_#t~ret2|)) 2147483647))) .cse3) (forall ((|v_binomialCoefficient_#t~ret3_14| Int)) (let ((.cse12 (div |c_binomialCoefficient_#t~ret1| (* |v_binomialCoefficient_#t~ret3_14| |c_binomialCoefficient_#t~ret2|)))) (or (< |v_binomialCoefficient_#t~ret3_14| 1) (not (= 0 (mod |c_binomialCoefficient_#t~ret1| (* |c_binomialCoefficient_#t~ret2| |v_binomialCoefficient_#t~ret3_14|)))) (<= (+ .cse12 (- 1)) 2147483647) (<= .cse12 2147483647)))) (or .cse9 (and .cse13 .cse14)) (or (and (or (forall ((|v_binomialCoefficient_#t~ret3_14| Int)) (or (< |v_binomialCoefficient_#t~ret3_14| 1) (<= (div |c_binomialCoefficient_#t~ret1| (* |v_binomialCoefficient_#t~ret3_14| |c_binomialCoefficient_#t~ret2|)) 2147483647))) .cse3) (or (and .cse15 .cse16) .cse9) .cse4 (forall ((|v_binomialCoefficient_#t~ret3_14| Int)) (let ((.cse17 (div |c_binomialCoefficient_#t~ret1| (* |v_binomialCoefficient_#t~ret3_14| |c_binomialCoefficient_#t~ret2|)))) (or (< |v_binomialCoefficient_#t~ret3_14| 1) (<= (+ 1 .cse17) 2147483647) (<= .cse17 2147483647)))) (forall ((|v_binomialCoefficient_#t~ret3_14| Int)) (or (< |v_binomialCoefficient_#t~ret3_14| 1) (not (< (* |c_binomialCoefficient_#t~ret2| |v_binomialCoefficient_#t~ret3_14|) 0)) (<= (div |c_binomialCoefficient_#t~ret1| (* |v_binomialCoefficient_#t~ret3_14| |c_binomialCoefficient_#t~ret2|)) 2147483647)))) .cse3) (or (and .cse13 .cse14 (forall ((|v_binomialCoefficient_#t~ret3_14| Int)) (let ((.cse18 (* |c_binomialCoefficient_#t~ret2| |v_binomialCoefficient_#t~ret3_14|))) (or (< |v_binomialCoefficient_#t~ret3_14| 1) (= 0 (mod |c_binomialCoefficient_#t~ret1| .cse18)) (not (< .cse18 0)) (<= (+ (div |c_binomialCoefficient_#t~ret1| (* |v_binomialCoefficient_#t~ret3_14| |c_binomialCoefficient_#t~ret2|)) (- 1)) 2147483647)))) (or (and .cse15 (forall ((|v_binomialCoefficient_#t~ret3_14| Int)) (let ((.cse19 (* |c_binomialCoefficient_#t~ret2| |v_binomialCoefficient_#t~ret3_14|))) (or (< |v_binomialCoefficient_#t~ret3_14| 1) (= 0 (mod |c_binomialCoefficient_#t~ret1| .cse19)) (not (< .cse19 0))))) .cse16 (or .cse9 (and (forall ((|v_binomialCoefficient_#t~ret3_14| Int)) (or (< |v_binomialCoefficient_#t~ret3_14| 1) (= 0 (mod |c_binomialCoefficient_#t~ret1| (* |c_binomialCoefficient_#t~ret2| |v_binomialCoefficient_#t~ret3_14|))) (<= (+ 1 (div |c_binomialCoefficient_#t~ret1| (* |v_binomialCoefficient_#t~ret3_14| |c_binomialCoefficient_#t~ret2|))) 2147483647))) (or (forall ((|v_binomialCoefficient_#t~ret3_14| Int)) (or (< |v_binomialCoefficient_#t~ret3_14| 1) (= 0 (mod |c_binomialCoefficient_#t~ret1| (* |c_binomialCoefficient_#t~ret2| |v_binomialCoefficient_#t~ret3_14|))))) .cse3)))) .cse3) (or (and (or (forall ((|v_binomialCoefficient_#t~ret3_14| Int)) (or (< |v_binomialCoefficient_#t~ret3_14| 1) (= 0 (mod |c_binomialCoefficient_#t~ret1| (* |c_binomialCoefficient_#t~ret2| |v_binomialCoefficient_#t~ret3_14|))) (<= (+ (div |c_binomialCoefficient_#t~ret1| (* |v_binomialCoefficient_#t~ret3_14| |c_binomialCoefficient_#t~ret2|)) (- 1)) 2147483647))) .cse3) (forall ((|v_binomialCoefficient_#t~ret3_14| Int)) (let ((.cse20 (div |c_binomialCoefficient_#t~ret1| (* |v_binomialCoefficient_#t~ret3_14| |c_binomialCoefficient_#t~ret2|)))) (or (< |v_binomialCoefficient_#t~ret3_14| 1) (= 0 (mod |c_binomialCoefficient_#t~ret1| (* |c_binomialCoefficient_#t~ret2| |v_binomialCoefficient_#t~ret3_14|))) (<= (+ 1 .cse20) 2147483647) (<= (+ .cse20 (- 1)) 2147483647))))) .cse9)) .cse9)))) is different from true [2023-02-18 23:33:47,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:33:47,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11874044] [2023-02-18 23:33:47,348 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:33:47,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537516906] [2023-02-18 23:33:47,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537516906] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 23:33:47,348 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 23:33:47,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2023-02-18 23:33:47,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578687334] [2023-02-18 23:33:47,348 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 23:33:47,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 23:33:47,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:33:47,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 23:33:47,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=39, Unknown=1, NotChecked=12, Total=72 [2023-02-18 23:33:47,350 INFO L87 Difference]: Start difference. First operand 200 states and 272 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 23:33:47,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:33:47,416 INFO L93 Difference]: Finished difference Result 255 states and 349 transitions. [2023-02-18 23:33:47,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 23:33:47,417 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2023-02-18 23:33:47,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:33:47,418 INFO L225 Difference]: With dead ends: 255 [2023-02-18 23:33:47,418 INFO L226 Difference]: Without dead ends: 254 [2023-02-18 23:33:47,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=20, Invalid=39, Unknown=1, NotChecked=12, Total=72 [2023-02-18 23:33:47,419 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 32 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:33:47,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 216 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:33:47,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-02-18 23:33:47,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 204. [2023-02-18 23:33:47,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 150 states have (on average 1.2933333333333332) internal successors, (194), 158 states have internal predecessors, (194), 31 states have call successors, (31), 9 states have call predecessors, (31), 10 states have return successors, (50), 36 states have call predecessors, (50), 31 states have call successors, (50) [2023-02-18 23:33:47,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 275 transitions. [2023-02-18 23:33:47,428 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 275 transitions. Word has length 33 [2023-02-18 23:33:47,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:33:47,428 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 275 transitions. [2023-02-18 23:33:47,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 23:33:47,428 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 275 transitions. [2023-02-18 23:33:47,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-18 23:33:47,429 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:33:47,429 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:33:47,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-18 23:33:47,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:47,634 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:33:47,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:33:47,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1848456444, now seen corresponding path program 1 times [2023-02-18 23:33:47,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:33:47,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121612298] [2023-02-18 23:33:47,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:47,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:33:47,642 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:33:47,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [542108829] [2023-02-18 23:33:47,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:47,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:47,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:33:47,659 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:33:47,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-18 23:33:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:47,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 23:33:47,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:33:47,700 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 23:33:47,700 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 23:33:47,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:33:47,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121612298] [2023-02-18 23:33:47,701 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:33:47,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542108829] [2023-02-18 23:33:47,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542108829] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:33:47,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:33:47,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 23:33:47,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406688361] [2023-02-18 23:33:47,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:33:47,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 23:33:47,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:33:47,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 23:33:47,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 23:33:47,703 INFO L87 Difference]: Start difference. First operand 204 states and 275 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-18 23:33:47,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:33:47,720 INFO L93 Difference]: Finished difference Result 204 states and 275 transitions. [2023-02-18 23:33:47,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 23:33:47,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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) Word has length 38 [2023-02-18 23:33:47,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:33:47,722 INFO L225 Difference]: With dead ends: 204 [2023-02-18 23:33:47,722 INFO L226 Difference]: Without dead ends: 203 [2023-02-18 23:33:47,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 23:33:47,722 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 13 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 23:33:47,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 145 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 23:33:47,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-02-18 23:33:47,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2023-02-18 23:33:47,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 150 states have (on average 1.28) internal successors, (192), 157 states have internal predecessors, (192), 31 states have call successors, (31), 9 states have call predecessors, (31), 10 states have return successors, (50), 36 states have call predecessors, (50), 31 states have call successors, (50) [2023-02-18 23:33:47,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 273 transitions. [2023-02-18 23:33:47,733 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 273 transitions. Word has length 38 [2023-02-18 23:33:47,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:33:47,733 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 273 transitions. [2023-02-18 23:33:47,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-18 23:33:47,733 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 273 transitions. [2023-02-18 23:33:47,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-18 23:33:47,735 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:33:47,735 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:33:47,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-18 23:33:47,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-02-18 23:33:47,938 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:33:47,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:33:47,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1467574807, now seen corresponding path program 1 times [2023-02-18 23:33:47,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:33:47,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895925148] [2023-02-18 23:33:47,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:47,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:33:47,942 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:33:47,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [130022225] [2023-02-18 23:33:47,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:47,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:47,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:33:47,945 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:33:47,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-18 23:33:47,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:48,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 23:33:48,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:33:48,006 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 23:33:48,006 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 23:33:48,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:33:48,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895925148] [2023-02-18 23:33:48,006 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:33:48,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130022225] [2023-02-18 23:33:48,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130022225] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:33:48,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:33:48,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 23:33:48,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417721799] [2023-02-18 23:33:48,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:33:48,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 23:33:48,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:33:48,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 23:33:48,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 23:33:48,008 INFO L87 Difference]: Start difference. First operand 203 states and 273 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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-18 23:33:48,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:33:48,029 INFO L93 Difference]: Finished difference Result 214 states and 286 transitions. [2023-02-18 23:33:48,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 23:33:48,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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) Word has length 39 [2023-02-18 23:33:48,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:33:48,031 INFO L225 Difference]: With dead ends: 214 [2023-02-18 23:33:48,031 INFO L226 Difference]: Without dead ends: 213 [2023-02-18 23:33:48,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 23:33:48,032 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 4 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 23:33:48,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 165 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 23:33:48,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-02-18 23:33:48,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2023-02-18 23:33:48,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 159 states have (on average 1.2641509433962264) internal successors, (201), 164 states have internal predecessors, (201), 32 states have call successors, (32), 9 states have call predecessors, (32), 10 states have return successors, (51), 39 states have call predecessors, (51), 32 states have call successors, (51) [2023-02-18 23:33:48,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2023-02-18 23:33:48,043 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 39 [2023-02-18 23:33:48,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:33:48,043 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2023-02-18 23:33:48,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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-18 23:33:48,044 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2023-02-18 23:33:48,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-18 23:33:48,044 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:33:48,045 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:33:48,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-18 23:33:48,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-18 23:33:48,251 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:33:48,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:33:48,251 INFO L85 PathProgramCache]: Analyzing trace with hash -2048877323, now seen corresponding path program 1 times [2023-02-18 23:33:48,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:33:48,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557775787] [2023-02-18 23:33:48,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:48,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:33:48,259 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:33:48,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [542425751] [2023-02-18 23:33:48,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:48,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:48,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:33:48,261 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-18 23:33:48,276 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-18 23:33:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:48,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 23:33:48,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:33:48,315 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-18 23:33:48,315 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 23:33:48,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:33:48,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557775787] [2023-02-18 23:33:48,315 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:33:48,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542425751] [2023-02-18 23:33:48,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542425751] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:33:48,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:33:48,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 23:33:48,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529248094] [2023-02-18 23:33:48,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:33:48,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 23:33:48,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:33:48,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 23:33:48,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 23:33:48,318 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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-18 23:33:48,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:33:48,332 INFO L93 Difference]: Finished difference Result 213 states and 284 transitions. [2023-02-18 23:33:48,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 23:33:48,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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) Word has length 42 [2023-02-18 23:33:48,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:33:48,334 INFO L225 Difference]: With dead ends: 213 [2023-02-18 23:33:48,334 INFO L226 Difference]: Without dead ends: 212 [2023-02-18 23:33:48,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 23:33:48,335 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 8 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 23:33:48,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 142 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 23:33:48,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2023-02-18 23:33:48,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2023-02-18 23:33:48,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 159 states have (on average 1.2578616352201257) internal successors, (200), 163 states have internal predecessors, (200), 32 states have call successors, (32), 9 states have call predecessors, (32), 10 states have return successors, (51), 39 states have call predecessors, (51), 32 states have call successors, (51) [2023-02-18 23:33:48,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 283 transitions. [2023-02-18 23:33:48,345 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 283 transitions. Word has length 42 [2023-02-18 23:33:48,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:33:48,345 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 283 transitions. [2023-02-18 23:33:48,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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-18 23:33:48,346 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 283 transitions. [2023-02-18 23:33:48,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-18 23:33:48,346 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:33:48,346 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:33:48,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-18 23:33:48,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:48,554 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:33:48,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:33:48,554 INFO L85 PathProgramCache]: Analyzing trace with hash 909312544, now seen corresponding path program 1 times [2023-02-18 23:33:48,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:33:48,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399408049] [2023-02-18 23:33:48,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:48,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:33:48,559 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:33:48,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1614123350] [2023-02-18 23:33:48,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:48,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:48,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:33:48,560 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-18 23:33:48,572 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-18 23:33:48,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:48,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 23:33:48,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:33:48,606 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-18 23:33:48,606 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 23:33:48,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:33:48,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399408049] [2023-02-18 23:33:48,606 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:33:48,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614123350] [2023-02-18 23:33:48,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614123350] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:33:48,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:33:48,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 23:33:48,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936128165] [2023-02-18 23:33:48,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:33:48,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 23:33:48,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:33:48,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 23:33:48,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 23:33:48,608 INFO L87 Difference]: Start difference. First operand 212 states and 283 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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-18 23:33:48,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:33:48,625 INFO L93 Difference]: Finished difference Result 217 states and 287 transitions. [2023-02-18 23:33:48,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 23:33:48,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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) Word has length 43 [2023-02-18 23:33:48,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:33:48,627 INFO L225 Difference]: With dead ends: 217 [2023-02-18 23:33:48,627 INFO L226 Difference]: Without dead ends: 216 [2023-02-18 23:33:48,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 23:33:48,627 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 5 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 23:33:48,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 159 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 23:33:48,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-02-18 23:33:48,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2023-02-18 23:33:48,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 162 states have (on average 1.2530864197530864) internal successors, (203), 166 states have internal predecessors, (203), 32 states have call successors, (32), 9 states have call predecessors, (32), 10 states have return successors, (51), 39 states have call predecessors, (51), 32 states have call successors, (51) [2023-02-18 23:33:48,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 286 transitions. [2023-02-18 23:33:48,635 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 286 transitions. Word has length 43 [2023-02-18 23:33:48,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:33:48,635 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 286 transitions. [2023-02-18 23:33:48,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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-18 23:33:48,636 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 286 transitions. [2023-02-18 23:33:48,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-18 23:33:48,636 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:33:48,636 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:33:48,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-18 23:33:48,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-18 23:33:48,841 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:33:48,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:33:48,841 INFO L85 PathProgramCache]: Analyzing trace with hash -504640214, now seen corresponding path program 1 times [2023-02-18 23:33:48,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:33:48,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474912246] [2023-02-18 23:33:48,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:48,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:33:48,846 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:33:48,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2123753729] [2023-02-18 23:33:48,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:48,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:48,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:33:48,847 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-18 23:33:48,849 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-18 23:33:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:48,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 23:33:48,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:33:48,901 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 23:33:48,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:33:48,958 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 23:33:48,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:33:48,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474912246] [2023-02-18 23:33:48,958 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:33:48,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123753729] [2023-02-18 23:33:48,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123753729] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:33:48,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:33:48,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-02-18 23:33:48,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688761973] [2023-02-18 23:33:48,959 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:33:48,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 23:33:48,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:33:48,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 23:33:48,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2023-02-18 23:33:48,960 INFO L87 Difference]: Start difference. First operand 215 states and 286 transitions. Second operand has 16 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 7 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-18 23:33:49,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:33:49,240 INFO L93 Difference]: Finished difference Result 315 states and 408 transitions. [2023-02-18 23:33:49,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-18 23:33:49,240 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 7 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 48 [2023-02-18 23:33:49,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:33:49,242 INFO L225 Difference]: With dead ends: 315 [2023-02-18 23:33:49,242 INFO L226 Difference]: Without dead ends: 314 [2023-02-18 23:33:49,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2023-02-18 23:33:49,243 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 151 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 23:33:49,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 566 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 23:33:49,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2023-02-18 23:33:49,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 278. [2023-02-18 23:33:49,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 210 states have (on average 1.2904761904761906) internal successors, (271), 216 states have internal predecessors, (271), 42 states have call successors, (42), 12 states have call predecessors, (42), 15 states have return successors, (69), 49 states have call predecessors, (69), 42 states have call successors, (69) [2023-02-18 23:33:49,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 382 transitions. [2023-02-18 23:33:49,255 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 382 transitions. Word has length 48 [2023-02-18 23:33:49,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:33:49,255 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 382 transitions. [2023-02-18 23:33:49,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 7 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-18 23:33:49,255 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 382 transitions. [2023-02-18 23:33:49,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-18 23:33:49,256 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:33:49,256 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 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, 1, 1, 1] [2023-02-18 23:33:49,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-02-18 23:33:49,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-18 23:33:49,461 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:33:49,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:33:49,462 INFO L85 PathProgramCache]: Analyzing trace with hash -953842833, now seen corresponding path program 1 times [2023-02-18 23:33:49,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:33:49,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014013030] [2023-02-18 23:33:49,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:49,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:33:49,467 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:33:49,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [705467688] [2023-02-18 23:33:49,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:49,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:49,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:33:49,468 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:33:49,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-18 23:33:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:49,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 23:33:49,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:33:49,537 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-18 23:33:49,537 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 23:33:49,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:33:49,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014013030] [2023-02-18 23:33:49,538 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:33:49,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705467688] [2023-02-18 23:33:49,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705467688] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:33:49,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:33:49,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 23:33:49,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419666282] [2023-02-18 23:33:49,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:33:49,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 23:33:49,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:33:49,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 23:33:49,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-18 23:33:49,540 INFO L87 Difference]: Start difference. First operand 278 states and 382 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-18 23:33:49,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:33:49,592 INFO L93 Difference]: Finished difference Result 497 states and 686 transitions. [2023-02-18 23:33:49,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 23:33:49,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 54 [2023-02-18 23:33:49,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:33:49,593 INFO L225 Difference]: With dead ends: 497 [2023-02-18 23:33:49,593 INFO L226 Difference]: Without dead ends: 253 [2023-02-18 23:33:49,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-02-18 23:33:49,595 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 17 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 23:33:49,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 154 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 23:33:49,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-02-18 23:33:49,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2023-02-18 23:33:49,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 190 states have (on average 1.2789473684210526) internal successors, (243), 197 states have internal predecessors, (243), 37 states have call successors, (37), 11 states have call predecessors, (37), 14 states have return successors, (61), 43 states have call predecessors, (61), 37 states have call successors, (61) [2023-02-18 23:33:49,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 341 transitions. [2023-02-18 23:33:49,602 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 341 transitions. Word has length 54 [2023-02-18 23:33:49,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:33:49,602 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 341 transitions. [2023-02-18 23:33:49,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-18 23:33:49,603 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 341 transitions. [2023-02-18 23:33:49,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-18 23:33:49,603 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:33:49,603 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:33:49,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-18 23:33:49,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:49,808 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:33:49,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:33:49,809 INFO L85 PathProgramCache]: Analyzing trace with hash 732083949, now seen corresponding path program 2 times [2023-02-18 23:33:49,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:33:49,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103260816] [2023-02-18 23:33:49,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:49,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:33:49,813 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:33:49,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [546926980] [2023-02-18 23:33:49,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 23:33:49,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:49,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:33:49,817 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:33:49,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-18 23:33:49,850 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 23:33:49,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:33:49,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-18 23:33:49,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:33:49,869 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-18 23:33:49,869 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 23:33:49,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:33:49,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103260816] [2023-02-18 23:33:49,869 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:33:49,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546926980] [2023-02-18 23:33:49,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546926980] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:33:49,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:33:49,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-18 23:33:49,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126001956] [2023-02-18 23:33:49,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:33:49,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 23:33:49,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:33:49,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 23:33:49,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-18 23:33:49,870 INFO L87 Difference]: Start difference. First operand 252 states and 341 transitions. Second operand has 8 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-18 23:33:49,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:33:49,999 INFO L93 Difference]: Finished difference Result 517 states and 717 transitions. [2023-02-18 23:33:49,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 23:33:49,999 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 54 [2023-02-18 23:33:49,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:33:50,000 INFO L225 Difference]: With dead ends: 517 [2023-02-18 23:33:50,001 INFO L226 Difference]: Without dead ends: 303 [2023-02-18 23:33:50,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-18 23:33:50,002 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 55 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:33:50,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 340 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:33:50,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-02-18 23:33:50,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 296. [2023-02-18 23:33:50,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 224 states have (on average 1.3080357142857142) internal successors, (293), 229 states have internal predecessors, (293), 45 states have call successors, (45), 13 states have call predecessors, (45), 16 states have return successors, (75), 53 states have call predecessors, (75), 45 states have call successors, (75) [2023-02-18 23:33:50,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 413 transitions. [2023-02-18 23:33:50,010 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 413 transitions. Word has length 54 [2023-02-18 23:33:50,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:33:50,010 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 413 transitions. [2023-02-18 23:33:50,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-18 23:33:50,011 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 413 transitions. [2023-02-18 23:33:50,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-18 23:33:50,011 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:33:50,011 INFO L195 NwaCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:33:50,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-18 23:33:50,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:50,216 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:33:50,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:33:50,216 INFO L85 PathProgramCache]: Analyzing trace with hash -36930177, now seen corresponding path program 1 times [2023-02-18 23:33:50,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:33:50,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513886515] [2023-02-18 23:33:50,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:50,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:33:50,220 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:33:50,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1844650359] [2023-02-18 23:33:50,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:50,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:50,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:33:50,222 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:33:50,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-18 23:33:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:50,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 23:33:50,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:33:50,278 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 23:33:50,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:33:50,318 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 23:33:50,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:33:50,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513886515] [2023-02-18 23:33:50,318 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:33:50,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844650359] [2023-02-18 23:33:50,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844650359] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:33:50,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:33:50,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2023-02-18 23:33:50,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262549272] [2023-02-18 23:33:50,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:33:50,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-18 23:33:50,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:33:50,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-18 23:33:50,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-02-18 23:33:50,319 INFO L87 Difference]: Start difference. First operand 296 states and 413 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-18 23:33:50,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:33:50,448 INFO L93 Difference]: Finished difference Result 533 states and 738 transitions. [2023-02-18 23:33:50,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-18 23:33:50,449 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 53 [2023-02-18 23:33:50,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:33:50,450 INFO L225 Difference]: With dead ends: 533 [2023-02-18 23:33:50,450 INFO L226 Difference]: Without dead ends: 324 [2023-02-18 23:33:50,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2023-02-18 23:33:50,451 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 48 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:33:50,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 427 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:33:50,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2023-02-18 23:33:50,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 307. [2023-02-18 23:33:50,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 235 states have (on average 1.3021276595744682) internal successors, (306), 240 states have internal predecessors, (306), 45 states have call successors, (45), 13 states have call predecessors, (45), 16 states have return successors, (75), 53 states have call predecessors, (75), 45 states have call successors, (75) [2023-02-18 23:33:50,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 426 transitions. [2023-02-18 23:33:50,460 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 426 transitions. Word has length 53 [2023-02-18 23:33:50,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:33:50,461 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 426 transitions. [2023-02-18 23:33:50,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-18 23:33:50,461 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 426 transitions. [2023-02-18 23:33:50,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-18 23:33:50,461 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:33:50,461 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:33:50,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-18 23:33:50,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-02-18 23:33:50,669 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:33:50,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:33:50,669 INFO L85 PathProgramCache]: Analyzing trace with hash 726408517, now seen corresponding path program 1 times [2023-02-18 23:33:50,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:33:50,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209443337] [2023-02-18 23:33:50,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:50,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:33:50,688 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:33:50,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1391408880] [2023-02-18 23:33:50,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:50,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:50,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:33:50,690 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:33:50,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-18 23:33:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:50,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 23:33:50,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:33:50,734 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-18 23:33:50,735 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 23:33:50,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:33:50,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209443337] [2023-02-18 23:33:50,735 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:33:50,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391408880] [2023-02-18 23:33:50,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391408880] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:33:50,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:33:50,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 23:33:50,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270824831] [2023-02-18 23:33:50,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:33:50,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 23:33:50,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:33:50,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 23:33:50,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-18 23:33:50,737 INFO L87 Difference]: Start difference. First operand 307 states and 426 transitions. Second operand has 6 states, 4 states have (on average 8.25) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-18 23:33:50,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:33:50,765 INFO L93 Difference]: Finished difference Result 307 states and 426 transitions. [2023-02-18 23:33:50,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 23:33:50,767 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 8.25) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2023-02-18 23:33:50,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:33:50,768 INFO L225 Difference]: With dead ends: 307 [2023-02-18 23:33:50,769 INFO L226 Difference]: Without dead ends: 306 [2023-02-18 23:33:50,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-18 23:33:50,769 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 7 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 23:33:50,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 202 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 23:33:50,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2023-02-18 23:33:50,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2023-02-18 23:33:50,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 235 states have (on average 1.2893617021276595) internal successors, (303), 239 states have internal predecessors, (303), 45 states have call successors, (45), 13 states have call predecessors, (45), 16 states have return successors, (75), 53 states have call predecessors, (75), 45 states have call successors, (75) [2023-02-18 23:33:50,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 423 transitions. [2023-02-18 23:33:50,779 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 423 transitions. Word has length 55 [2023-02-18 23:33:50,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:33:50,779 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 423 transitions. [2023-02-18 23:33:50,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 8.25) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-18 23:33:50,779 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 423 transitions. [2023-02-18 23:33:50,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-18 23:33:50,780 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:33:50,780 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:33:50,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-18 23:33:50,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-02-18 23:33:50,984 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting factErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:33:50,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:33:50,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1043827591, now seen corresponding path program 1 times [2023-02-18 23:33:50,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:33:50,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629280607] [2023-02-18 23:33:50,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:50,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:33:50,990 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:33:50,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1547203088] [2023-02-18 23:33:50,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:50,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:50,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:33:50,991 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:33:51,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-18 23:33:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:51,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 23:33:51,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:33:51,077 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 23:33:51,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:33:51,446 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 23:33:51,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:33:51,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629280607] [2023-02-18 23:33:51,447 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:33:51,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547203088] [2023-02-18 23:33:51,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547203088] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:33:51,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:33:51,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2023-02-18 23:33:51,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807573784] [2023-02-18 23:33:51,447 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:33:51,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-18 23:33:51,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:33:51,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-18 23:33:51,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2023-02-18 23:33:51,448 INFO L87 Difference]: Start difference. First operand 306 states and 423 transitions. Second operand has 20 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 16 states have internal predecessors, (56), 9 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-02-18 23:33:52,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:33:52,872 INFO L93 Difference]: Finished difference Result 608 states and 826 transitions. [2023-02-18 23:33:52,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-18 23:33:52,873 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 16 states have internal predecessors, (56), 9 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 56 [2023-02-18 23:33:52,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:33:52,874 INFO L225 Difference]: With dead ends: 608 [2023-02-18 23:33:52,874 INFO L226 Difference]: Without dead ends: 394 [2023-02-18 23:33:52,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=853, Unknown=0, NotChecked=0, Total=992 [2023-02-18 23:33:52,876 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 149 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:33:52,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 979 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-18 23:33:52,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2023-02-18 23:33:52,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 367. [2023-02-18 23:33:52,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 286 states have (on average 1.2727272727272727) internal successors, (364), 285 states have internal predecessors, (364), 52 states have call successors, (52), 16 states have call predecessors, (52), 19 states have return successors, (85), 65 states have call predecessors, (85), 52 states have call successors, (85) [2023-02-18 23:33:52,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 501 transitions. [2023-02-18 23:33:52,900 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 501 transitions. Word has length 56 [2023-02-18 23:33:52,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:33:52,900 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 501 transitions. [2023-02-18 23:33:52,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 16 states have internal predecessors, (56), 9 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-02-18 23:33:52,900 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 501 transitions. [2023-02-18 23:33:52,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-18 23:33:52,901 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:33:52,901 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 4, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:33:52,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-18 23:33:53,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:53,105 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:33:53,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:33:53,106 INFO L85 PathProgramCache]: Analyzing trace with hash 342724557, now seen corresponding path program 1 times [2023-02-18 23:33:53,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:33:53,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161948600] [2023-02-18 23:33:53,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:53,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:33:53,113 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:33:53,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [218000858] [2023-02-18 23:33:53,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:53,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:53,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:33:53,114 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:33:53,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-18 23:33:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:53,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-18 23:33:53,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:33:53,162 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-02-18 23:33:53,163 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 23:33:53,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:33:53,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161948600] [2023-02-18 23:33:53,163 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:33:53,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218000858] [2023-02-18 23:33:53,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218000858] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:33:53,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:33:53,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 23:33:53,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568511055] [2023-02-18 23:33:53,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:33:53,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 23:33:53,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:33:53,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 23:33:53,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-18 23:33:53,166 INFO L87 Difference]: Start difference. First operand 367 states and 501 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-18 23:33:53,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:33:53,241 INFO L93 Difference]: Finished difference Result 690 states and 937 transitions. [2023-02-18 23:33:53,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 23:33:53,242 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 64 [2023-02-18 23:33:53,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:33:53,243 INFO L225 Difference]: With dead ends: 690 [2023-02-18 23:33:53,243 INFO L226 Difference]: Without dead ends: 372 [2023-02-18 23:33:53,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-18 23:33:53,244 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 41 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:33:53,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 336 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:33:53,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2023-02-18 23:33:53,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 363. [2023-02-18 23:33:53,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 283 states have (on average 1.2614840989399294) internal successors, (357), 282 states have internal predecessors, (357), 50 states have call successors, (50), 17 states have call predecessors, (50), 20 states have return successors, (79), 63 states have call predecessors, (79), 50 states have call successors, (79) [2023-02-18 23:33:53,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 486 transitions. [2023-02-18 23:33:53,253 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 486 transitions. Word has length 64 [2023-02-18 23:33:53,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:33:53,254 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 486 transitions. [2023-02-18 23:33:53,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-18 23:33:53,254 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 486 transitions. [2023-02-18 23:33:53,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-18 23:33:53,254 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:33:53,254 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:33:53,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-18 23:33:53,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:53,460 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting binomialCoefficientErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:33:53,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:33:53,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1354749825, now seen corresponding path program 1 times [2023-02-18 23:33:53,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:33:53,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207972998] [2023-02-18 23:33:53,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:53,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:33:53,464 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:33:53,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [185746441] [2023-02-18 23:33:53,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:53,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:53,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:33:53,466 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:33:53,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-18 23:33:53,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:53,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-18 23:33:53,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:33:53,554 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-02-18 23:33:53,554 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 23:33:53,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:33:53,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207972998] [2023-02-18 23:33:53,554 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:33:53,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185746441] [2023-02-18 23:33:53,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185746441] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:33:53,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:33:53,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 23:33:53,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30717414] [2023-02-18 23:33:53,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:33:53,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 23:33:53,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:33:53,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 23:33:53,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-18 23:33:53,555 INFO L87 Difference]: Start difference. First operand 363 states and 486 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-02-18 23:33:53,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:33:53,667 INFO L93 Difference]: Finished difference Result 370 states and 486 transitions. [2023-02-18 23:33:53,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 23:33:53,667 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 66 [2023-02-18 23:33:53,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:33:53,669 INFO L225 Difference]: With dead ends: 370 [2023-02-18 23:33:53,669 INFO L226 Difference]: Without dead ends: 369 [2023-02-18 23:33:53,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-02-18 23:33:53,670 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 44 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:33:53,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 321 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:33:53,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2023-02-18 23:33:53,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 363. [2023-02-18 23:33:53,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 283 states have (on average 1.254416961130742) internal successors, (355), 282 states have internal predecessors, (355), 50 states have call successors, (50), 17 states have call predecessors, (50), 20 states have return successors, (79), 63 states have call predecessors, (79), 50 states have call successors, (79) [2023-02-18 23:33:53,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 484 transitions. [2023-02-18 23:33:53,678 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 484 transitions. Word has length 66 [2023-02-18 23:33:53,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:33:53,678 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 484 transitions. [2023-02-18 23:33:53,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-02-18 23:33:53,679 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 484 transitions. [2023-02-18 23:33:53,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-18 23:33:53,679 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:33:53,679 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:33:53,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-02-18 23:33:53,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-02-18 23:33:53,884 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting binomialCoefficientErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:33:53,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:33:53,887 INFO L85 PathProgramCache]: Analyzing trace with hash 952428439, now seen corresponding path program 1 times [2023-02-18 23:33:53,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:33:53,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881432005] [2023-02-18 23:33:53,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:53,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:33:53,893 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:33:53,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1970102371] [2023-02-18 23:33:53,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:53,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:53,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:33:53,895 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:33:53,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-02-18 23:33:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:53,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-18 23:33:53,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:33:53,947 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-02-18 23:33:53,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:33:53,985 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-02-18 23:33:53,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:33:53,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881432005] [2023-02-18 23:33:53,986 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:33:53,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970102371] [2023-02-18 23:33:53,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970102371] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:33:53,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:33:53,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2023-02-18 23:33:53,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695065264] [2023-02-18 23:33:53,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:33:53,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 23:33:53,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:33:53,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 23:33:53,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-02-18 23:33:53,988 INFO L87 Difference]: Start difference. First operand 363 states and 484 transitions. Second operand has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 12 states have internal predecessors, (53), 7 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-18 23:33:54,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:33:54,148 INFO L93 Difference]: Finished difference Result 444 states and 591 transitions. [2023-02-18 23:33:54,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-18 23:33:54,148 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 12 states have internal predecessors, (53), 7 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 67 [2023-02-18 23:33:54,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:33:54,150 INFO L225 Difference]: With dead ends: 444 [2023-02-18 23:33:54,150 INFO L226 Difference]: Without dead ends: 443 [2023-02-18 23:33:54,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2023-02-18 23:33:54,151 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 94 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:33:54,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 566 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:33:54,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2023-02-18 23:33:54,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 422. [2023-02-18 23:33:54,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 328 states have (on average 1.2591463414634145) internal successors, (413), 326 states have internal predecessors, (413), 62 states have call successors, (62), 19 states have call predecessors, (62), 22 states have return successors, (100), 76 states have call predecessors, (100), 62 states have call successors, (100) [2023-02-18 23:33:54,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 575 transitions. [2023-02-18 23:33:54,162 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 575 transitions. Word has length 67 [2023-02-18 23:33:54,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:33:54,163 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 575 transitions. [2023-02-18 23:33:54,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 12 states have internal predecessors, (53), 7 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-18 23:33:54,163 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 575 transitions. [2023-02-18 23:33:54,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-02-18 23:33:54,163 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:33:54,164 INFO L195 NwaCegarLoop]: trace histogram [8, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:33:54,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-02-18 23:33:54,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-02-18 23:33:54,368 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting factErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:33:54,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:33:54,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1835230983, now seen corresponding path program 1 times [2023-02-18 23:33:54,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:33:54,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847054298] [2023-02-18 23:33:54,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:54,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:33:54,373 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:33:54,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1414018323] [2023-02-18 23:33:54,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:54,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:54,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:33:54,382 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:33:54,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-02-18 23:33:54,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:54,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 23:33:54,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:33:54,448 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 67 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-02-18 23:33:54,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:33:54,482 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 35 proven. 23 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-02-18 23:33:54,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:33:54,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847054298] [2023-02-18 23:33:54,483 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:33:54,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414018323] [2023-02-18 23:33:54,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414018323] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:33:54,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:33:54,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2023-02-18 23:33:54,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831115175] [2023-02-18 23:33:54,483 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:33:54,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 23:33:54,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:33:54,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 23:33:54,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-02-18 23:33:54,485 INFO L87 Difference]: Start difference. First operand 422 states and 575 transitions. Second operand has 11 states, 10 states have (on average 5.0) internal successors, (50), 8 states have internal predecessors, (50), 6 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-02-18 23:33:54,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:33:54,615 INFO L93 Difference]: Finished difference Result 821 states and 1126 transitions. [2023-02-18 23:33:54,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 23:33:54,616 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 8 states have internal predecessors, (50), 6 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 76 [2023-02-18 23:33:54,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:33:54,617 INFO L225 Difference]: With dead ends: 821 [2023-02-18 23:33:54,618 INFO L226 Difference]: Without dead ends: 439 [2023-02-18 23:33:54,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 134 SyntacticMatches, 8 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2023-02-18 23:33:54,619 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 67 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:33:54,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 452 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:33:54,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2023-02-18 23:33:54,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 423. [2023-02-18 23:33:54,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 328 states have (on average 1.2560975609756098) internal successors, (412), 327 states have internal predecessors, (412), 62 states have call successors, (62), 20 states have call predecessors, (62), 23 states have return successors, (98), 75 states have call predecessors, (98), 62 states have call successors, (98) [2023-02-18 23:33:54,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 572 transitions. [2023-02-18 23:33:54,630 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 572 transitions. Word has length 76 [2023-02-18 23:33:54,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:33:54,630 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 572 transitions. [2023-02-18 23:33:54,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 8 states have internal predecessors, (50), 6 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-02-18 23:33:54,631 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 572 transitions. [2023-02-18 23:33:54,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-18 23:33:54,631 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:33:54,631 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:33:54,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-02-18 23:33:54,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-02-18 23:33:54,836 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:33:54,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:33:54,837 INFO L85 PathProgramCache]: Analyzing trace with hash -637059568, now seen corresponding path program 2 times [2023-02-18 23:33:54,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:33:54,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982899854] [2023-02-18 23:33:54,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:54,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:33:54,841 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:33:54,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [890963551] [2023-02-18 23:33:54,841 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 23:33:54,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:54,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:33:54,842 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:33:54,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-02-18 23:33:54,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 23:33:54,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:33:54,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 23:33:54,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:33:54,906 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-02-18 23:33:54,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:33:54,960 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-02-18 23:33:54,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:33:54,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982899854] [2023-02-18 23:33:54,960 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:33:54,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890963551] [2023-02-18 23:33:54,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890963551] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:33:54,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:33:54,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-02-18 23:33:54,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53679023] [2023-02-18 23:33:54,961 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:33:54,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 23:33:54,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:33:54,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 23:33:54,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2023-02-18 23:33:54,962 INFO L87 Difference]: Start difference. First operand 423 states and 572 transitions. Second operand has 16 states, 15 states have (on average 4.2) internal successors, (63), 12 states have internal predecessors, (63), 7 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-18 23:33:55,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:33:55,226 INFO L93 Difference]: Finished difference Result 481 states and 627 transitions. [2023-02-18 23:33:55,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-18 23:33:55,226 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.2) internal successors, (63), 12 states have internal predecessors, (63), 7 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 72 [2023-02-18 23:33:55,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:33:55,228 INFO L225 Difference]: With dead ends: 481 [2023-02-18 23:33:55,228 INFO L226 Difference]: Without dead ends: 480 [2023-02-18 23:33:55,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2023-02-18 23:33:55,228 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 144 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 23:33:55,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 495 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 23:33:55,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2023-02-18 23:33:55,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 472. [2023-02-18 23:33:55,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 366 states have (on average 1.2459016393442623) internal successors, (456), 367 states have internal predecessors, (456), 66 states have call successors, (66), 24 states have call predecessors, (66), 30 states have return successors, (103), 80 states have call predecessors, (103), 66 states have call successors, (103) [2023-02-18 23:33:55,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 625 transitions. [2023-02-18 23:33:55,240 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 625 transitions. Word has length 72 [2023-02-18 23:33:55,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:33:55,240 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 625 transitions. [2023-02-18 23:33:55,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.2) internal successors, (63), 12 states have internal predecessors, (63), 7 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-18 23:33:55,241 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 625 transitions. [2023-02-18 23:33:55,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-02-18 23:33:55,241 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:33:55,241 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:33:55,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-02-18 23:33:55,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:55,446 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting binomialCoefficientErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:33:55,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:33:55,446 INFO L85 PathProgramCache]: Analyzing trace with hash -927342394, now seen corresponding path program 1 times [2023-02-18 23:33:55,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:33:55,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145936646] [2023-02-18 23:33:55,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:55,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:33:55,456 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:33:55,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [957181533] [2023-02-18 23:33:55,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:55,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:55,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:33:55,457 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:33:55,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-02-18 23:33:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:55,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-18 23:33:55,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:33:55,538 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-18 23:33:55,538 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 23:33:55,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:33:55,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145936646] [2023-02-18 23:33:55,539 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:33:55,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957181533] [2023-02-18 23:33:55,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957181533] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:33:55,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:33:55,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-18 23:33:55,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583919494] [2023-02-18 23:33:55,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:33:55,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 23:33:55,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:33:55,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 23:33:55,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-18 23:33:55,541 INFO L87 Difference]: Start difference. First operand 472 states and 625 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2023-02-18 23:33:55,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:33:55,665 INFO L93 Difference]: Finished difference Result 886 states and 1184 transitions. [2023-02-18 23:33:55,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 23:33:55,665 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 76 [2023-02-18 23:33:55,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:33:55,667 INFO L225 Difference]: With dead ends: 886 [2023-02-18 23:33:55,667 INFO L226 Difference]: Without dead ends: 471 [2023-02-18 23:33:55,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-02-18 23:33:55,669 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 57 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:33:55,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 235 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:33:55,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2023-02-18 23:33:55,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 464. [2023-02-18 23:33:55,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 359 states have (on average 1.2479108635097493) internal successors, (448), 361 states have internal predecessors, (448), 66 states have call successors, (66), 24 states have call predecessors, (66), 29 states have return successors, (101), 78 states have call predecessors, (101), 66 states have call successors, (101) [2023-02-18 23:33:55,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 615 transitions. [2023-02-18 23:33:55,680 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 615 transitions. Word has length 76 [2023-02-18 23:33:55,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:33:55,680 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 615 transitions. [2023-02-18 23:33:55,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2023-02-18 23:33:55,680 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 615 transitions. [2023-02-18 23:33:55,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-02-18 23:33:55,681 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:33:55,681 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 6, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:33:55,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-02-18 23:33:55,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-02-18 23:33:55,885 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting factErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:33:55,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:33:55,886 INFO L85 PathProgramCache]: Analyzing trace with hash 291419757, now seen corresponding path program 2 times [2023-02-18 23:33:55,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:33:55,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549414331] [2023-02-18 23:33:55,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:55,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:33:55,890 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:33:55,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [958161511] [2023-02-18 23:33:55,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 23:33:55,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:55,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:33:55,892 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:33:55,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-02-18 23:33:55,929 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 23:33:55,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:33:55,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-18 23:33:55,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:33:55,970 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-02-18 23:33:55,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:33:56,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:33:56,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549414331] [2023-02-18 23:33:56,170 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:33:56,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958161511] [2023-02-18 23:33:56,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958161511] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 23:33:56,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 23:33:56,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2023-02-18 23:33:56,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158136918] [2023-02-18 23:33:56,170 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 23:33:56,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 23:33:56,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:33:56,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 23:33:56,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-02-18 23:33:56,171 INFO L87 Difference]: Start difference. First operand 464 states and 615 transitions. Second operand has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-18 23:33:56,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:33:56,315 INFO L93 Difference]: Finished difference Result 498 states and 649 transitions. [2023-02-18 23:33:56,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 23:33:56,315 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 80 [2023-02-18 23:33:56,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:33:56,317 INFO L225 Difference]: With dead ends: 498 [2023-02-18 23:33:56,317 INFO L226 Difference]: Without dead ends: 497 [2023-02-18 23:33:56,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2023-02-18 23:33:56,317 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 55 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:33:56,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 504 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:33:56,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2023-02-18 23:33:56,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 488. [2023-02-18 23:33:56,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 378 states have (on average 1.2380952380952381) internal successors, (468), 380 states have internal predecessors, (468), 68 states have call successors, (68), 27 states have call predecessors, (68), 32 states have return successors, (103), 80 states have call predecessors, (103), 68 states have call successors, (103) [2023-02-18 23:33:56,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 639 transitions. [2023-02-18 23:33:56,329 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 639 transitions. Word has length 80 [2023-02-18 23:33:56,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:33:56,329 INFO L495 AbstractCegarLoop]: Abstraction has 488 states and 639 transitions. [2023-02-18 23:33:56,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-18 23:33:56,329 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 639 transitions. [2023-02-18 23:33:56,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-02-18 23:33:56,330 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:33:56,330 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:33:56,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-02-18 23:33:56,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:56,535 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting binomialCoefficientErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:33:56,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:33:56,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1026169764, now seen corresponding path program 1 times [2023-02-18 23:33:56,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:33:56,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434246748] [2023-02-18 23:33:56,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:56,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:33:56,541 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:33:56,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1703248105] [2023-02-18 23:33:56,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:56,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:56,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:33:56,542 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:33:56,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-02-18 23:33:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:56,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-18 23:33:56,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:33:56,591 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2023-02-18 23:33:56,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:33:56,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:33:56,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434246748] [2023-02-18 23:33:56,667 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:33:56,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703248105] [2023-02-18 23:33:56,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703248105] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 23:33:56,667 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 23:33:56,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2023-02-18 23:33:56,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150520673] [2023-02-18 23:33:56,667 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 23:33:56,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 23:33:56,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:33:56,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 23:33:56,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-18 23:33:56,668 INFO L87 Difference]: Start difference. First operand 488 states and 639 transitions. Second operand has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-18 23:33:56,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:33:56,702 INFO L93 Difference]: Finished difference Result 528 states and 701 transitions. [2023-02-18 23:33:56,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 23:33:56,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 84 [2023-02-18 23:33:56,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:33:56,705 INFO L225 Difference]: With dead ends: 528 [2023-02-18 23:33:56,705 INFO L226 Difference]: Without dead ends: 527 [2023-02-18 23:33:56,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-18 23:33:56,705 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 14 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 23:33:56,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 149 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 23:33:56,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2023-02-18 23:33:56,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 500. [2023-02-18 23:33:56,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 390 states have (on average 1.2230769230769232) internal successors, (477), 386 states have internal predecessors, (477), 68 states have call successors, (68), 27 states have call predecessors, (68), 32 states have return successors, (103), 86 states have call predecessors, (103), 68 states have call successors, (103) [2023-02-18 23:33:56,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 648 transitions. [2023-02-18 23:33:56,716 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 648 transitions. Word has length 84 [2023-02-18 23:33:56,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:33:56,717 INFO L495 AbstractCegarLoop]: Abstraction has 500 states and 648 transitions. [2023-02-18 23:33:56,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-18 23:33:56,717 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 648 transitions. [2023-02-18 23:33:56,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-02-18 23:33:56,717 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:33:56,718 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:33:56,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-02-18 23:33:56,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:56,922 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting binomialCoefficientErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:33:56,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:33:56,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1746491672, now seen corresponding path program 1 times [2023-02-18 23:33:56,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:33:56,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425101318] [2023-02-18 23:33:56,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:56,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:33:56,928 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:33:56,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1358713036] [2023-02-18 23:33:56,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:56,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:56,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:33:56,931 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:33:56,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-02-18 23:33:56,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:56,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-18 23:33:56,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:33:56,993 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2023-02-18 23:33:56,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:33:57,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:33:57,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425101318] [2023-02-18 23:33:57,074 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:33:57,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358713036] [2023-02-18 23:33:57,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358713036] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 23:33:57,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 23:33:57,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2023-02-18 23:33:57,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927860051] [2023-02-18 23:33:57,074 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 23:33:57,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 23:33:57,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:33:57,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 23:33:57,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-18 23:33:57,075 INFO L87 Difference]: Start difference. First operand 500 states and 648 transitions. Second operand has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-18 23:33:57,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:33:57,108 INFO L93 Difference]: Finished difference Result 527 states and 692 transitions. [2023-02-18 23:33:57,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 23:33:57,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 85 [2023-02-18 23:33:57,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:33:57,111 INFO L225 Difference]: With dead ends: 527 [2023-02-18 23:33:57,111 INFO L226 Difference]: Without dead ends: 526 [2023-02-18 23:33:57,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-18 23:33:57,112 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 10 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 23:33:57,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 151 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 23:33:57,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2023-02-18 23:33:57,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 485. [2023-02-18 23:33:57,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 375 states have (on average 1.224) internal successors, (459), 378 states have internal predecessors, (459), 68 states have call successors, (68), 27 states have call predecessors, (68), 32 states have return successors, (103), 79 states have call predecessors, (103), 68 states have call successors, (103) [2023-02-18 23:33:57,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 630 transitions. [2023-02-18 23:33:57,124 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 630 transitions. Word has length 85 [2023-02-18 23:33:57,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:33:57,124 INFO L495 AbstractCegarLoop]: Abstraction has 485 states and 630 transitions. [2023-02-18 23:33:57,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-18 23:33:57,124 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 630 transitions. [2023-02-18 23:33:57,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-18 23:33:57,125 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:33:57,125 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2023-02-18 23:33:57,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-02-18 23:33:57,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:57,329 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting binomialCoefficientErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:33:57,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:33:57,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1693332954, now seen corresponding path program 2 times [2023-02-18 23:33:57,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:33:57,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991385091] [2023-02-18 23:33:57,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:57,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:33:57,334 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:33:57,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [288040753] [2023-02-18 23:33:57,334 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 23:33:57,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:57,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:33:57,335 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:33:57,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-02-18 23:33:57,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 23:33:57,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:33:57,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-18 23:33:57,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:33:57,543 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2023-02-18 23:33:57,544 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 23:33:57,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:33:57,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991385091] [2023-02-18 23:33:57,544 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:33:57,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288040753] [2023-02-18 23:33:57,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288040753] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:33:57,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:33:57,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-18 23:33:57,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773729849] [2023-02-18 23:33:57,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:33:57,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 23:33:57,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:33:57,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 23:33:57,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-02-18 23:33:57,546 INFO L87 Difference]: Start difference. First operand 485 states and 630 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 4 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-18 23:33:57,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:33:57,639 INFO L93 Difference]: Finished difference Result 489 states and 638 transitions. [2023-02-18 23:33:57,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 23:33:57,640 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 4 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 86 [2023-02-18 23:33:57,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:33:57,642 INFO L225 Difference]: With dead ends: 489 [2023-02-18 23:33:57,643 INFO L226 Difference]: Without dead ends: 487 [2023-02-18 23:33:57,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-02-18 23:33:57,643 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 15 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:33:57,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 200 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:33:57,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2023-02-18 23:33:57,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 483. [2023-02-18 23:33:57,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 375 states have (on average 1.184) internal successors, (444), 376 states have internal predecessors, (444), 68 states have call successors, (68), 27 states have call predecessors, (68), 32 states have return successors, (103), 79 states have call predecessors, (103), 68 states have call successors, (103) [2023-02-18 23:33:57,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 615 transitions. [2023-02-18 23:33:57,670 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 615 transitions. Word has length 86 [2023-02-18 23:33:57,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:33:57,671 INFO L495 AbstractCegarLoop]: Abstraction has 483 states and 615 transitions. [2023-02-18 23:33:57,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 4 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-18 23:33:57,672 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 615 transitions. [2023-02-18 23:33:57,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-02-18 23:33:57,672 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:33:57,672 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2023-02-18 23:33:57,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-02-18 23:33:57,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:57,873 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting binomialCoefficientErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:33:57,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:33:57,873 INFO L85 PathProgramCache]: Analyzing trace with hash -953713958, now seen corresponding path program 1 times [2023-02-18 23:33:57,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:33:57,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662711599] [2023-02-18 23:33:57,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:57,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:33:57,878 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:33:57,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1342902017] [2023-02-18 23:33:57,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:33:57,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:33:57,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:33:57,880 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:33:57,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-02-18 23:33:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:33:57,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 42 conjunts are in the unsatisfiable core [2023-02-18 23:33:57,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:33:58,123 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 59 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-02-18 23:33:58,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:34:00,731 WARN L859 $PredicateComparison]: unable to prove that (and (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse0 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (>= .cse0 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse2 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse0))) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse0)) (<= (+ .cse1 (- 1)) 2147483647) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse2)) (<= .cse1 2147483647) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 .cse1) 2147483647) (not (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|))) 2147483647))))) (< .cse2 0))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse4 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse3 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse4))) (or (<= (+ .cse3 (- 1)) 2147483647) (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= .cse3 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse4)))))) (not (>= .cse4 (- 2147483648))) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse6 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse5 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse6))) (or (<= (+ .cse5 (- 1)) 2147483647) (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= .cse5 2147483647)))) (not (< .cse6 0)) (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0) (not (>= .cse6 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse7 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (< .cse7 0)) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse9 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23)))) (.cse8 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse7))) (or (<= (+ .cse8 (- 1)) 2147483647) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse9)) (< .cse9 0) (<= .cse8 2147483647) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (not (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|))) 2147483647))))) (not (>= .cse7 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse10 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse12 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse11 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse10))) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse10)) (<= (+ .cse11 (- 1)) 2147483647) (not (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) (- 1)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse12)) (<= .cse11 2147483647) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 .cse11) 2147483647)))) (not (< .cse12 0))))) (not (>= .cse10 (- 2147483648)))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse13 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse13) 2147483647))) (not (>= .cse13 (- 2147483648))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse15 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse14 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse14))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse15) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse15))) (not (< .cse14 0))))) (not (< .cse15 0)) (not (>= .cse15 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse17 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse16 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (not (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) (- 1)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse16)) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse17) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse17))) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (not (< .cse16 0))))) (not (< .cse17 0)) (not (>= .cse17 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse20 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse19 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse18 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse20))) (or (<= (+ .cse18 (- 1)) 2147483647) (not (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) (- 1)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse19)) (<= .cse18 2147483647) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 .cse18) 2147483647)))) (not (< .cse19 0))))) (not (>= .cse20 (- 2147483648)))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse21 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (>= .cse21 (- 2147483648))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse21)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse21)) 2147483647))) (< .cse21 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse22 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (>= .cse22 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse24 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse23 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse22))) (or (<= (+ .cse23 (- 1)) 2147483647) (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse24))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= .cse23 2147483647)))) (< .cse24 0))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse27 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse25 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse26 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse27))) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse25)) (<= .cse26 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse27))) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 .cse26) 2147483647) (not (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|))) 2147483647))))) (< .cse25 0)))) (not (>= .cse27 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse29 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse28 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse28 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse30 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse29))) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse29)) (<= (+ .cse30 (- 1)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse28))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 .cse30) 2147483647))))))) (not (>= .cse29 (- 2147483648)))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse31 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (< .cse31 0)) (not (>= .cse31 (- 2147483648))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse31) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse31)))))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse32 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (>= .cse32 (- 2147483648))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse32) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse32))))) (< .cse32 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse35 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse33 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse34 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse35))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse33))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= .cse34 2147483647) (<= (+ 1 .cse34) 2147483647)))) (< .cse33 0)))) (not (>= .cse35 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse36 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (>= .cse36 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse38 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse37 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse36))) (or (<= (+ .cse37 (- 1)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse38))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= .cse37 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse36)))))) (not (< .cse38 0)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse39 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse40 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse39)) (not (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) (- 1)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse40)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse39)) 2147483647))) (not (< .cse40 0))))) (not (>= .cse39 (- 2147483648))) (< .cse39 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse42 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse41 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse41))) (< .cse41 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse42) 2147483647)))) (not (< .cse42 0)) (not (>= .cse42 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse43 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse44 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse43)) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse44))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse43)) 2147483647))) (not (< .cse44 0))))) (not (>= .cse43 (- 2147483648))) (< .cse43 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse45 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (< .cse45 0)) (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse45) 2147483647))) (not (>= .cse45 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse48 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse46 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse47 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse48))) (or (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse46))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= .cse47 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse48))) (<= (+ 1 .cse47) 2147483647)))) (not (< .cse46 0))))) (not (>= .cse48 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse50 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse49 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse49 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse50)) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse49))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse50)) 2147483647)))))) (not (>= .cse50 (- 2147483648))) (< .cse50 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse51 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse52 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse51)) (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse51) (- 1)) 2147483647) (not (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) (- 1)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse52)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (not (< .cse52 0))))) (not (< .cse51 0)) (not (>= .cse51 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse54 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse53 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse53 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse55 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse54))) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse54)) (<= (+ .cse55 (- 1)) 2147483647) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse53)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 .cse55) 2147483647) (not (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|))) 2147483647)))))))) (not (>= .cse54 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse57 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse56 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse57))) (or (<= (+ .cse56 (- 1)) 2147483647) (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= .cse56 2147483647) (<= (+ 1 .cse56) 2147483647)))) (not (>= .cse57 (- 2147483648))) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse59 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse58 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse59))) (or (<= (+ .cse58 (- 1)) 2147483647) (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= .cse58 2147483647) (<= (+ 1 .cse58) 2147483647)))) (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0) (not (>= .cse59 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse60 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (>= .cse60 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse61 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse61 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse61))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse60) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse60)))))))) (< .cse60 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse63 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse62 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse63))) (or (<= (+ .cse62 (- 1)) 2147483647) (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= .cse62 2147483647)))) (not (>= .cse63 (- 2147483648))) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse64 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (>= .cse64 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse65 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse65 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse65))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse64) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse64))))))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse68 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse66 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse67 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse68))) (or (not (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) (- 1)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse66)) (<= .cse67 2147483647) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 .cse67) 2147483647)))) (not (< .cse66 0))))) (not (>= .cse68 (- 2147483648))) (< .cse68 0)))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse69 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse70 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse69))) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse69)) (<= (+ .cse70 (- 1)) 2147483647) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 .cse70) 2147483647)))) (not (>= .cse69 (- 2147483648))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse71 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse71) 2147483647))) (not (>= .cse71 (- 2147483648))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648)) (< .cse71 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse72 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse72) 2147483647))) (not (>= .cse72 (- 2147483648))) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0)) (< .cse72 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse75 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse73 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse74 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse75))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse73))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= .cse74 2147483647) (<= (+ 1 .cse74) 2147483647)))) (not (< .cse73 0))))) (not (>= .cse75 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse76 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (>= .cse76 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse77 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse78 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse76))) (or (not (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) (- 1)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse77)) (<= .cse78 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse76))) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 .cse78) 2147483647)))) (not (< .cse77 0)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse80 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse79 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse79 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse79))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse80) 2147483647)))))) (not (>= .cse80 (- 2147483648))) (< .cse80 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse81 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (>= .cse81 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse82 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse82))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse81) 2147483647))) (not (< .cse82 0))))) (< .cse81 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse84 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse83 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (not (< .cse83 0)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse85 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse84))) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse84)) (<= (+ .cse85 (- 1)) 2147483647) (not (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) (- 1)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse83)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 .cse85) 2147483647))))))) (not (>= .cse84 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse86 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (< .cse86 0)) (not (>= .cse86 (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse86) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse86))))) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse87 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse88 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse87)) (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse87) (- 1)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse88))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (not (< .cse88 0))))) (not (< .cse87 0)) (not (>= .cse87 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse89 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (>= .cse89 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse91 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse90 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse89))) (or (<= (+ .cse90 (- 1)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse91))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= .cse90 2147483647) (<= (+ 1 .cse90) 2147483647)))) (< .cse91 0))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse94 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse93 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse92 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse94))) (or (<= (+ .cse92 (- 1)) 2147483647) (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse93))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= .cse92 2147483647)))) (not (< .cse93 0))))) (not (>= .cse94 (- 2147483648)))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse95 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (>= .cse95 (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse96 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse95))) (or (<= .cse96 2147483647) (<= (+ 1 .cse96) 2147483647)))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648)) (< .cse95 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse98 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse97 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse97))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse98) 2147483647) (not (< .cse97 0))))) (not (< .cse98 0)) (not (>= .cse98 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse99 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (< .cse99 0)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse99) 2147483647))) (not (>= .cse99 (- 2147483648))) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse102 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse101 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23)))) (.cse100 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse102))) (or (<= (+ .cse100 (- 1)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse101))) (< .cse101 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= .cse100 2147483647)))) (not (< .cse102 0)) (not (>= .cse102 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse104 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse103 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse104))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= .cse103 2147483647) (<= (+ 1 .cse103) 2147483647)))) (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0) (not (>= .cse104 (- 2147483648))) (< .cse104 0)))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse105 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse105) 2147483647))) (not (< .cse105 0)) (not (>= .cse105 (- 2147483648))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse107 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse106 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse106 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse108 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse107))) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse107)) (<= (+ .cse108 (- 1)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse106))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= .cse108 2147483647) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 .cse108) 2147483647))))))) (not (>= .cse107 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse111 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse109 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse109 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse110 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse111))) (or (<= (+ .cse110 (- 1)) 2147483647) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse109)) (<= .cse110 2147483647) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 .cse110) 2147483647) (not (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|))) 2147483647)))))))) (not (>= .cse111 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse113 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse112 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse113))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= .cse112 2147483647) (<= (+ 1 .cse112) 2147483647)))) (not (>= .cse113 (- 2147483648))) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0)) (< .cse113 0)))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse114 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (>= .cse114 (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse115 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse114))) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse114)) (<= (+ .cse115 (- 1)) 2147483647) (<= .cse115 2147483647) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 .cse115) 2147483647)))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse116 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (>= .cse116 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse117 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse117)) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse116) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse116))) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (not (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|))) 2147483647)))) (< .cse117 0)))) (< .cse116 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse119 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse118 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (not (< .cse118 0)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (not (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) (- 1)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse118)) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse119) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse119))) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0))))))) (not (>= .cse119 (- 2147483648))) (< .cse119 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse121 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse120 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse121))) (or (<= (+ .cse120 (- 1)) 2147483647) (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= .cse120 2147483647)))) (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0) (not (>= .cse121 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse122 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (>= .cse122 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse123 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse123 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse124 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse122))) (or (<= (+ .cse124 (- 1)) 2147483647) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse123)) (<= .cse124 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse122))) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (not (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|))) 2147483647))))))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse125 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse125) 2147483647))) (not (>= .cse125 (- 2147483648))) (< .cse125 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse126 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (>= .cse126 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse127 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (not (< .cse127 0)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse128 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse126))) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse126)) (<= (+ .cse128 (- 1)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse127))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 .cse128) 2147483647)))))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse129 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (< .cse129 0)) (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0) (not (>= .cse129 (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse129) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse129)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse132 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse130 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse130 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse131 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse132))) (or (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse130))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= .cse131 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse132))) (<= (+ 1 .cse131) 2147483647))))))) (not (>= .cse132 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse133 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (>= .cse133 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse134 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse134 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse133)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse134)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse133)) 2147483647) (not (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|))) 2147483647))))))) (< .cse133 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse135 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (< .cse135 0)) (not (>= .cse135 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse136 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse135)) (.cse137 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (<= (+ .cse136 (- 1)) 2147483647) (not (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) (- 1)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse137)) (<= .cse136 2147483647) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (not (< .cse137 0)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse138 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse138) 2147483647))) (not (>= .cse138 (- 2147483648))) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse139 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (>= .cse139 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse141 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse140 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse139))) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse139)) (<= (+ .cse140 (- 1)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse141))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= .cse140 2147483647) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 .cse140) 2147483647)))) (not (< .cse141 0)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse142 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (>= .cse142 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse143 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse143))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse142) 2147483647))) (not (< .cse143 0)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse144 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (>= .cse144 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse145 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse145)) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse144) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse144))) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (not (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|))) 2147483647)))) (< .cse145 0))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse146 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse146) 2147483647))) (not (>= .cse146 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse149 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse147 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse148 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse149))) (or (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse147))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= .cse148 2147483647) (<= (+ 1 .cse148) 2147483647)))) (< .cse147 0)))) (not (>= .cse149 (- 2147483648))) (< .cse149 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse152 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse151 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse150 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse152))) (or (<= (+ .cse150 (- 1)) 2147483647) (not (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) (- 1)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse151)) (<= .cse150 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse152))) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0))))) (not (< .cse151 0))))) (not (>= .cse152 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse154 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse153 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse154))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= .cse153 2147483647) (<= (+ 1 .cse153) 2147483647)))) (not (>= .cse154 (- 2147483648))) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse156 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse155 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse155 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse155))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse156) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse156)))))))) (not (>= .cse156 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse158 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse157 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse158))) (or (<= (+ .cse157 (- 1)) 2147483647) (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= .cse157 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse158)))))) (not (>= .cse158 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse159 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (>= .cse159 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse160 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (not (< .cse160 0)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse160))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse159) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse159)))))))) (< .cse159 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse161 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (< .cse161 0)) (not (>= .cse161 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse162 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse161)) (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse161) (- 1)) 2147483647) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse162)) (< .cse162 0) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (not (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|))) 2147483647)))))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse164 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse163 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse164))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= .cse163 2147483647) (<= (+ 1 .cse163) 2147483647)))) (not (>= .cse164 (- 2147483648))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse166 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse165 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse166))) (or (<= (+ .cse165 (- 1)) 2147483647) (<= .cse165 2147483647) (<= (+ 1 .cse165) 2147483647)))) (not (>= .cse166 (- 2147483648))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse167 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (>= .cse167 (- 2147483648))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse167) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse167)))))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse168 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (>= .cse168 (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse169 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse168))) (or (<= .cse169 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse168))) (<= (+ 1 .cse169) 2147483647)))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse170 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (>= .cse170 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse171 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (not (< .cse171 0)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse171))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse170) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse170))))))))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse172 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (>= .cse172 (- 2147483648))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse172) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse172)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse174 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse173 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse173 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse173))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse174) 2147483647)))))) (not (>= .cse174 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse175 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (< .cse175 0)) (not (>= .cse175 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse176 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse176))) (< .cse176 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse175) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse175))))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse177 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0) (not (>= .cse177 (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse177) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse177)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse180 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse179 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse178 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse180))) (or (<= (+ .cse178 (- 1)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse179))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= .cse178 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse180)))))) (< .cse179 0)))) (not (>= .cse180 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse182 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse181 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse181)) (< .cse181 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse182) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse182))) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (not (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|))) 2147483647))))) (not (< .cse182 0)) (not (>= .cse182 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse183 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0) (not (>= .cse183 (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse183) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse183))))) (< .cse183 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse184 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (>= .cse184 (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse184) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse184))))) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0)) (< .cse184 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse185 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (>= .cse185 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse187 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse186 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse185))) (or (<= (+ .cse186 (- 1)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse187))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= .cse186 2147483647) (<= (+ 1 .cse186) 2147483647)))) (not (< .cse187 0)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse188 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (>= .cse188 (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse188) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse188))))) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse189 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (>= .cse189 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse190 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse191 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse189))) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse190)) (<= .cse191 2147483647) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 .cse191) 2147483647) (not (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|))) 2147483647))))) (< .cse190 0)))) (< .cse189 0)))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse192 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (>= .cse192 (- 2147483648))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse193 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse192))) (or (<= (+ .cse193 (- 1)) 2147483647) (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= .cse193 2147483647))))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse195 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse194 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse195))) (or (<= (+ .cse194 (- 1)) 2147483647) (<= .cse194 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse195)))))) (not (>= .cse195 (- 2147483648))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse197 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse196 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse197))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= .cse196 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse197))) (<= (+ 1 .cse196) 2147483647)))) (not (>= .cse197 (- 2147483648))) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse199 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse198 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (not (< .cse198 0)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse198))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse199) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse199)))))))) (not (>= .cse199 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse200 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse201 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse200)) (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse200) (- 1)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse201))) (< .cse201 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0))))) (not (< .cse200 0)) (not (>= .cse200 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse203 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse202 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse203))) (or (<= (+ .cse202 (- 1)) 2147483647) (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= .cse202 2147483647)))) (not (< .cse203 0)) (not (>= .cse203 (- 2147483648))) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse205 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse204 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse205))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= .cse204 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse205))) (<= (+ 1 .cse204) 2147483647)))) (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0) (not (>= .cse205 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse207 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse206 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (not (< .cse206 0)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (not (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) (- 1)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse206)) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse207) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse207))) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0))))))) (not (>= .cse207 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse208 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (< .cse208 0)) (not (>= .cse208 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse209 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse208)) (.cse210 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (<= (+ .cse209 (- 1)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse210))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= .cse209 2147483647) (not (< .cse210 0)))))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse212 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse211 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse212))) (or (<= (+ .cse211 (- 1)) 2147483647) (<= .cse211 2147483647)))) (not (< .cse212 0)) (not (>= .cse212 (- 2147483648))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse214 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse213 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse214))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= .cse213 2147483647) (<= (+ 1 .cse213) 2147483647)))) (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0) (not (>= .cse214 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse215 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (>= .cse215 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse216 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse217 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse215))) (or (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse216))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= .cse217 2147483647) (<= (+ 1 .cse217) 2147483647)))) (not (< .cse216 0))))) (< .cse215 0)))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse218 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (< .cse218 0)) (not (>= .cse218 (- 2147483648))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse218)) (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse218) (- 1)) 2147483647) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)))))))) is different from true [2023-02-18 23:34:04,161 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_fact_~n |c_fact_#t~ret0|))) (and (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse0 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse0 (- 2147483648))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse0)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse2 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (< .cse2 0)) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse3 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse2))) (not (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) (- 1)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse3)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (not (< .cse3 0))))) (not (>= .cse2 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse5 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse6 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse4 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse4 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse5))) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse6))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (+ 1 .cse4) 2147483647)))) (not (< .cse6 0))))) (not (>= .cse5 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (or (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse8 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse7 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= .cse7 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse8))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (+ 1 .cse7) 2147483647)))) (not (< .cse8 0))))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse9 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= .cse9 2147483647) (<= (+ 1 .cse9) 2147483647)))) (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse10 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (< .cse10 0)) (not (>= .cse10 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse11 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (not (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) (- 1)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse11)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse10)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (not (< .cse11 0)) (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) (- 1)) 2147483647))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse12 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse12 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse13 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= .cse13 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse12))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (+ 1 .cse13) 2147483647))))))) (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse14 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (< .cse14 0)) (not (>= .cse14 (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse14)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) (- 1)) 2147483647))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse15 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse15 (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse16 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= .cse16 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (+ 1 .cse16) 2147483647)))) (< .cse15 0) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse17 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse17 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse19 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse18 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse18 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse17))) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse19)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (not (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|))) 2147483647)) (<= (+ .cse18 (- 1)) 2147483647)))) (< .cse19 0))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse20 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (< .cse20 0)) (not (>= .cse20 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse21 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse21))) (< .cse21 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse22 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse22 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse23 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse23 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse24 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse24 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse22))) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse23))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (+ .cse24 (- 1)) 2147483647)))))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse25 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse25 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse26 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse27 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse26))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse25)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 .cse27) 2147483647) (<= (+ .cse27 (- 1)) 2147483647)))) (not (< .cse26 0)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (or (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse28 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse28 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse29 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= .cse29 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse28))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (+ .cse29 (- 1)) 2147483647))))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse30 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse30 (- 2147483648))) (< .cse30 0) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse31 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (< .cse31 0)) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse33 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23)))) (.cse32 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse32 2147483647) (not (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) (- 1)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse33)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (not (< .cse33 0)) (<= (+ .cse32 (- 1)) 2147483647)))) (not (>= .cse31 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse34 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse34 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse36 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse35 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse35 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse34))) (not (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) (- 1)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse36)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 .cse35) 2147483647)))) (not (< .cse36 0)))))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse37 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse37 (- 2147483648))) (< .cse37 0) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse37)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse38 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse38 (- 2147483648))) (< .cse38 0) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse40 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse39 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse39 2147483647) (not (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) (- 1)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse40)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 .cse39) 2147483647)))) (not (< .cse40 0)))))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (or (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse41 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= .cse41 2147483647) (<= (+ .cse41 (- 1)) 2147483647)))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse42 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (< .cse42 0)) (not (>= .cse42 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse43 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse42))) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse43))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (not (< .cse43 0)))))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse44 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse44 (- 2147483648))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse45 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse44)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 .cse45) 2147483647) (<= (+ .cse45 (- 1)) 2147483647))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (or (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse46 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= .cse46 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (+ 1 .cse46) 2147483647) (<= (+ .cse46 (- 1)) 2147483647)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse47 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse47 (- 2147483648))) (< .cse47 0) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse48 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (not (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) (- 1)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse48)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse47)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) 2147483647))) (not (< .cse48 0)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse49 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse49 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse51 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse50 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse50 2147483647) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse51)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 .cse50) 2147483647) (not (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|))) 2147483647))))) (< .cse51 0)))) (< .cse49 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse54 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse53 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse52 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse52 2147483647) (not (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) (- 1)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse53)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse54)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 .cse52) 2147483647) (<= (+ .cse52 (- 1)) 2147483647)))) (not (< .cse53 0))))) (not (>= .cse54 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (or (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse55 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= .cse55 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (+ 1 .cse55) 2147483647)))) (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse56 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse56 (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse57 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= .cse57 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse56))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (+ 1 .cse57) 2147483647)))) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse58 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (< .cse58 0)) (not (>= .cse58 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse60 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23)))) (.cse59 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse59 2147483647) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse60)) (< .cse60 0) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (not (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|))) 2147483647)) (<= (+ .cse59 (- 1)) 2147483647))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (or (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse61 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (not (< .cse61 0)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse62 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= .cse62 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse61))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (+ .cse62 (- 1)) 2147483647))))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse63 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse63 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse64 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse64 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse65 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse65 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse63))) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse64))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (+ 1 .cse65) 2147483647)))))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse66 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse66 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse67 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse66))) (not (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) (- 1)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse67)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)))) (not (< .cse67 0)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse68 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse68 (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse69 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= .cse69 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse68))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (+ 1 .cse69) 2147483647)))) (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0)))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse70 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse70 (- 2147483648))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse70)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse72 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse71 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse71))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse72)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (not (< .cse71 0)) (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) (- 1)) 2147483647)))) (not (< .cse72 0)) (not (>= .cse72 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse74 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse73 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse73 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse73))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))))) (not (>= .cse74 (- 2147483648))) (< .cse74 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse75 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (< .cse75 0)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse75))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))) (not (>= .cse75 (- 2147483648))) (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse77 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse76 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse76 2147483647) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse77)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 .cse76) 2147483647) (not (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|))) 2147483647)) (<= (+ .cse76 (- 1)) 2147483647)))) (< .cse77 0)))) (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse78 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse78 (- 2147483648))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse79 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse79 2147483647) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse78)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 .cse79) 2147483647) (<= (+ .cse79 (- 1)) 2147483647))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse82 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse81 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23)))) (.cse80 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse80 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse81))) (< .cse81 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (+ .cse80 (- 1)) 2147483647)))) (not (< .cse82 0)) (not (>= .cse82 (- 2147483648)))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse83 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (< .cse83 0)) (not (>= .cse83 (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse84 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse84 2147483647) (<= (+ .cse84 (- 1)) 2147483647)))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (or (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse85 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse85))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))) (not (< .cse85 0))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse86 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (< .cse86 0)) (not (>= .cse86 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse87 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse87)) (< .cse87 0) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse86)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (not (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|))) 2147483647)) (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) (- 1)) 2147483647))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse88 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse89 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse88))) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse89)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (not (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|))) 2147483647)))) (< .cse89 0)))) (not (>= .cse88 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse90 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse90 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse91 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse90))) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse91))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))) (< .cse91 0))))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse92 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse92)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) 2147483647))) (not (>= .cse92 (- 2147483648))) (< .cse92 0) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse93 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse93 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse95 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse94 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse94 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse93))) (not (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) (- 1)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse95)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ .cse94 (- 1)) 2147483647)))) (not (< .cse95 0)))))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647))) (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse96 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse96 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse97 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse97))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse96)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) 2147483647))) (not (< .cse97 0))))) (< .cse96 0)))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse99 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse98 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse98 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse99))) (<= (+ 1 .cse98) 2147483647)))) (not (>= .cse99 (- 2147483648))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse100 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse100 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse101 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse100))) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse101))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))) (not (< .cse101 0)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse104 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse102 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse102 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse103 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse103 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse102))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse104)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 .cse103) 2147483647) (<= (+ .cse103 (- 1)) 2147483647))))))) (not (>= .cse104 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse105 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse105 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse106 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse106 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse107 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse106))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse105)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 .cse107) 2147483647) (<= (+ .cse107 (- 1)) 2147483647)))))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse108 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse108))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))) (not (>= .cse108 (- 2147483648))) (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse111 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse110 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse109 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse109 2147483647) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse110)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse111)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 .cse109) 2147483647) (not (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|))) 2147483647)) (<= (+ .cse109 (- 1)) 2147483647)))) (< .cse110 0)))) (not (>= .cse111 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse112 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= .cse112 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (+ .cse112 (- 1)) 2147483647)))) (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse114 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse113 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= .cse113 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (+ .cse113 (- 1)) 2147483647)))) (not (< .cse114 0)) (not (>= .cse114 (- 2147483648))) (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse115 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse116 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse115))) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse116)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (not (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|))) 2147483647)))) (< .cse116 0)))) (not (>= .cse115 (- 2147483648))) (< .cse115 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse117 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse117 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse117))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))))) (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse118 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse118 (- 2147483648))) (< .cse118 0) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse119 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse119))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))) (not (< .cse119 0)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse120 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse120 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse121 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse121 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse120))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (+ 1 .cse121) 2147483647) (<= (+ .cse121 (- 1)) 2147483647))))))) (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse123 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse122 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse122 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse122))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse123)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) 2147483647)))))) (not (>= .cse123 (- 2147483648))) (< .cse123 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse124 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse124 (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse125 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= .cse125 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (+ 1 .cse125) 2147483647)))) (< .cse124 0) (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse126 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse126 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse127 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse126))) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse127))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))) (< .cse127 0)))) (< .cse126 0)))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse128 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647))) (not (>= .cse128 (- 2147483648))) (< .cse128 0) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse130 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse129 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse129))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (not (< .cse129 0))))) (not (< .cse130 0)) (not (>= .cse130 (- 2147483648)))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse131 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (< .cse131 0)) (not (>= .cse131 (- 2147483648))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse131)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse132 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (< .cse132 0)) (not (>= .cse132 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse134 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23)))) (.cse133 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse133 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse134))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (not (< .cse134 0)) (<= (+ .cse133 (- 1)) 2147483647))))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse135 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (< .cse135 0)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647))) (not (>= .cse135 (- 2147483648))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse136 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (< .cse136 0)) (not (>= .cse136 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse137 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse136))) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse137)) (< .cse137 0) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (not (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|))) 2147483647)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (or (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse138 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse138 (- 2147483648))) (< .cse138 0) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse139 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse139 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse139)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse138)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) 2147483647) (not (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|))) 2147483647)))))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse141 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse140 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse140))) (< .cse140 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse141)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) (- 1)) 2147483647)))) (not (< .cse141 0)) (not (>= .cse141 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse143 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse142 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse144 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (not (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) (- 1)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse142)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse143)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 .cse144) 2147483647) (<= (+ .cse144 (- 1)) 2147483647)))) (not (< .cse142 0))))) (not (>= .cse143 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (or (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse145 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse145))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))) (not (>= .cse145 (- 2147483648))) (< .cse145 0) (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse146 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (< .cse146 0)) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse147 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse146))) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse147))) (< .cse147 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))) (not (>= .cse146 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse148 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse148 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse149 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse148))) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse149))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))) (not (< .cse149 0))))) (< .cse148 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse150 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= .cse150 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (+ .cse150 (- 1)) 2147483647)))) (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (or (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse151 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= .cse151 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (+ 1 .cse151) 2147483647)))) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse152 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse152 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse154 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse153 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse153 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse152))) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse154)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 .cse153) 2147483647) (not (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|))) 2147483647))))) (< .cse154 0))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse155 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse155 (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse156 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= .cse156 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse155))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (+ .cse156 (- 1)) 2147483647)))) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (or (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse157 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= .cse157 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (+ 1 .cse157) 2147483647) (<= (+ .cse157 (- 1)) 2147483647)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse158 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse158 (- 2147483648))) (< .cse158 0) (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse159 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse159))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))) (not (>= .cse159 (- 2147483648))) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse161 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse160 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= .cse160 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (+ .cse160 (- 1)) 2147483647)))) (not (< .cse161 0)) (not (>= .cse161 (- 2147483648))) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse162 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse162 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse164 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse163 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse163 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse164))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse162)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 .cse163) 2147483647) (<= (+ .cse163 (- 1)) 2147483647)))) (not (< .cse164 0)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse165 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse165 (- 2147483648))) (< .cse165 0) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse167 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse166 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse166 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse167))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (+ 1 .cse166) 2147483647)))) (< .cse167 0))))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse169 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse168 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse168 2147483647) (<= (+ 1 .cse168) 2147483647)))) (not (>= .cse169 (- 2147483648))) (< .cse169 0) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (or (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse171 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse170 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse170 2147483647) (not (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) (- 1)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse171)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 .cse170) 2147483647) (<= (+ .cse170 (- 1)) 2147483647)))) (not (< .cse171 0))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse172 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse172 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse173 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse172))) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse173))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))) (< .cse173 0))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse174 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (< .cse174 0)) (not (>= .cse174 (- 2147483648))) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (or (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse176 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse175 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse175 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse176))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (+ 1 .cse175) 2147483647) (<= (+ .cse175 (- 1)) 2147483647)))) (not (< .cse176 0))))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (or (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse177 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse177 2147483647) (<= (+ 1 .cse177) 2147483647) (<= (+ .cse177 (- 1)) 2147483647)))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse178 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (< .cse178 0)) (not (>= .cse178 (- 2147483648))) (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse180 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse179 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse179 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse180))) (<= (+ .cse179 (- 1)) 2147483647)))) (not (>= .cse180 (- 2147483648))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse182 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse181 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse181 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse183 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse181)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse182)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (<= (+ 1 .cse183) 2147483647) (not (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|))) 2147483647)) (<= (+ .cse183 (- 1)) 2147483647))))))) (not (>= .cse182 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse184 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse184 (- 2147483648))) (< .cse184 0) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse185 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse184))) (not (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) (- 1)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse185)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)))) (not (< .cse185 0)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse186 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (< .cse186 0)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse186))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))) (not (>= .cse186 (- 2147483648))) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse187 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse187 (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse188 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= .cse188 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse187))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (+ .cse188 (- 1)) 2147483647)))) (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse189 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse190 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse189))) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse190))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))) (not (< .cse190 0))))) (not (>= .cse189 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse191 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse191))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))) (not (>= .cse191 (- 2147483648))) (< .cse191 0) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse192 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse192 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse194 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse193 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse193 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse192))) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse194))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (+ .cse193 (- 1)) 2147483647)))) (not (< .cse194 0)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse195 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse195 (- 2147483648))) (< .cse195 0) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse197 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse196 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse196 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse197))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (<= (+ 1 .cse196) 2147483647)))) (not (< .cse197 0)))))))))) is different from true [2023-02-18 23:34:08,294 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_fact_~n 1))) (and (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse0 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse0 (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse0)) (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) (- 1)) 2147483647) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648)) (not (< .cse0 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse2 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse2 (- 2147483648))) (< .cse2 0) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse3 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse3 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse2)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse3)) (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) 2147483647) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (not (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|))) 2147483647)))))))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse4 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647))) (not (>= .cse4 (- 2147483648))) (< .cse4 0) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse5 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse5 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse6 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse6 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse7 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= (+ .cse7 (- 1)) 2147483647) (<= .cse7 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse5))) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse6))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse8 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse8 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse9 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (not (< .cse9 0)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse8))) (not (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) (- 1)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse9)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)))))))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse10 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse10 (- 2147483648))) (< .cse10 0) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse10)) (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) 2147483647) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse11 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse11 (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse12 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= .cse12 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse11))) (<= (+ 1 .cse12) 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (or (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))) (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse13 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse13 (- 2147483648))) (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse14 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (+ .cse14 (- 1)) 2147483647) (<= .cse14 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse13))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (or (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse16 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse15 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= .cse15 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse16))) (<= (+ 1 .cse15) 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))) (< .cse16 0)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse17 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse17 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse19 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse18 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse17)) (<= (+ .cse18 (- 1)) 2147483647) (<= .cse18 2147483647) (not (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) (- 1)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse19)) (<= (+ 1 .cse18) 2147483647) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0))))) (not (< .cse19 0)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse20 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse20 (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0)) (not (< .cse20 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse21 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse21 (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))) (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0) (< .cse21 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse22 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse22 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse23 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse23))) (< .cse23 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))) (not (< .cse22 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse24 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse24 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse25 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse24)) (not (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) (- 1)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse25)) (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) 2147483647) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)))) (not (< .cse25 0))))) (< .cse24 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (or (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse27 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse26 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= (+ .cse26 (- 1)) 2147483647) (<= .cse26 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse27))) (<= (+ 1 .cse26) 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))) (< .cse27 0)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse28 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse28 (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse29 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (+ .cse29 (- 1)) 2147483647) (<= .cse29 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0)) (not (< .cse28 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (or (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse30 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= .cse30 2147483647) (<= (+ 1 .cse30) 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse31 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse31 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse32 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse32 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse33 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse31)) (<= (+ .cse33 (- 1)) 2147483647) (<= .cse33 2147483647) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse32)) (<= (+ 1 .cse33) 2147483647) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (not (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|))) 2147483647))))))))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse34 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse34 (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse35 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse35 2147483647) (<= (+ 1 .cse35) 2147483647)))) (< .cse34 0) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse36 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse36 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse37 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse36)) (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) (- 1)) 2147483647) (not (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) (- 1)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse37)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (not (< .cse37 0))))) (not (< .cse36 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse38 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse38 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse39 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse39 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse39))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))))) (< .cse38 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse40 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse40 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse42 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse41 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= (+ .cse41 (- 1)) 2147483647) (<= .cse41 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse40))) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse42))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))) (not (< .cse42 0)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse43 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse43 (- 2147483648))) (< .cse43 0) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse44 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse43))) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse44))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))) (< .cse44 0))))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse45 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse45 (- 2147483648))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648)) (not (< .cse45 0)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse46 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= (+ .cse46 (- 1)) 2147483647) (<= .cse46 2147483647))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse47 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse47 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse48 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse48 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse49 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse49 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse47))) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse48))) (<= (+ 1 .cse49) 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse50 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse50 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse52 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse51 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse50)) (<= (+ .cse51 (- 1)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse52))) (<= (+ 1 .cse51) 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0))))) (< .cse52 0))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (or (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse54 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse53 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= .cse53 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse54))) (<= (+ 1 .cse53) 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))) (not (< .cse54 0))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse55 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse55 (- 2147483648))) (< .cse55 0) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse56 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse55))) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse56)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (not (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|))) 2147483647)))) (< .cse56 0))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse57 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse57 (- 2147483648))) (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse57))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))) (not (< .cse57 0))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse58 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse58 (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse59 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse58)) (<= (+ .cse59 (- 1)) 2147483647) (<= .cse59 2147483647) (<= (+ 1 .cse59) 2147483647) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0))))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse60 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse60 (- 2147483648))) (< .cse60 0) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse62 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse61 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse61 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse62))) (<= (+ 1 .cse61) 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))) (not (< .cse62 0)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse63 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse63 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse64 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse63))) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse64))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))) (not (< .cse64 0)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (or (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse65 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= .cse65 2147483647) (<= (+ 1 .cse65) 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (or (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse66 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (+ .cse66 (- 1)) 2147483647) (<= .cse66 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse67 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse67 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse68 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse67))) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse68))) (< .cse68 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))) (not (< .cse67 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (or (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse70 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse69 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= (+ .cse69 (- 1)) 2147483647) (<= .cse69 2147483647) (not (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) (- 1)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse70)) (<= (+ 1 .cse69) 2147483647) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0))))) (not (< .cse70 0))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (or (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse71 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse71 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse72 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (+ .cse72 (- 1)) 2147483647) (<= .cse72 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse71))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse73 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse73 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse74 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse73))) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse74))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (not (< .cse74 0))))) (not (< .cse73 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (or (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse75 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (+ .cse75 (- 1)) 2147483647) (<= .cse75 2147483647) (<= (+ 1 .cse75) 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (or (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse77 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse76 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (+ .cse76 (- 1)) 2147483647) (<= .cse76 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse77))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))) (not (< .cse77 0))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse80 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse78 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse78 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse79 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse79 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse80))) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse78)) (<= (+ 1 .cse79) 2147483647) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (not (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|))) 2147483647)))))))) (not (>= .cse80 (- 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse81 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse81 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse83 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse82 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= (+ .cse82 (- 1)) 2147483647) (<= .cse82 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse81))) (not (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) (- 1)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse83)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0))))) (not (< .cse83 0)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse84 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse84 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse85 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (not (< .cse85 0)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse86 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse86 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse84))) (not (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) (- 1)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse85)) (<= (+ 1 .cse86) 2147483647) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0))))))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (or (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse87 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse87 (- 2147483648))) (< .cse87 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse87))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse88 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse88 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse89 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse88))) (not (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) (- 1)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse89)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (not (< .cse89 0))))) (not (< .cse88 0))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse90 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse90))))) (not (>= .cse90 (- 2147483648))) (< .cse90 0) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (or (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse91 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse91 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse91))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse92 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse92 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse94 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse93 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse92)) (<= (+ .cse93 (- 1)) 2147483647) (not (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) (- 1)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse94)) (<= (+ 1 .cse93) 2147483647) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0))))) (not (< .cse94 0)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse95 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse95 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse96 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse95))) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse96))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))) (< .cse96 0))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse97 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse97 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse98 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse97))) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse98)) (< .cse98 0) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (not (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|))) 2147483647))))) (not (< .cse97 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse99 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse99 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse100 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse100 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse99)) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse100))) (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0))))))) (< .cse99 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse101 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse101 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse102 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse101))) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse102))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))) (not (< .cse102 0)))))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (or (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse103 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= .cse103 2147483647) (<= (+ 1 .cse103) 2147483647)))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse104 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse104 (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse104))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0)) (not (< .cse104 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse105 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse105 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse106 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (.cse107 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (<= (+ .cse106 (- 1)) 2147483647) (<= .cse106 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse107))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (not (< .cse107 0))))) (not (< .cse105 0))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse108 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse108))))) (not (>= .cse108 (- 2147483648))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648)) (not (< .cse108 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse109 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse109 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse110 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse109)) (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) (- 1)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse110))) (< .cse110 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0))))) (not (< .cse109 0))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (or (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse111 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (+ .cse111 (- 1)) 2147483647) (<= .cse111 2147483647)))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648)))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse112 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647))) (not (>= .cse112 (- 2147483648))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648)) (not (< .cse112 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse113 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse113 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse114 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse113))) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse114))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))) (< .cse114 0))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse115 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse115 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse117 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse116 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse115)) (<= (+ .cse116 (- 1)) 2147483647) (<= .cse116 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse117))) (<= (+ 1 .cse116) 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0))))) (not (< .cse117 0)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse118 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse118 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse120 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse119 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse119 2147483647) (not (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) (- 1)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse120)) (<= (+ 1 .cse119) 2147483647) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0))))) (not (< .cse120 0))))) (< .cse118 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse121 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse121 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse122 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse122))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (not (< .cse122 0))))) (not (< .cse121 0))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse123 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse123 (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse124 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse124 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse123))) (<= (+ 1 .cse124) 2147483647)))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse125 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse125 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse126 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (not (< .cse126 0)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse125))) (not (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) (- 1)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse126)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0))))))) (< .cse125 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse127 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse127 (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))) (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0) (not (< .cse127 0))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse128 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse128))))) (not (>= .cse128 (- 2147483648))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse129 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse129 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse130 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse130))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))) (not (< .cse130 0))))) (< .cse129 0)))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse131 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse131 (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse132 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse131)) (<= (+ .cse132 (- 1)) 2147483647) (<= (+ 1 .cse132) 2147483647) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0))))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse133 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse133 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse134 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (.cse135 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (<= (+ .cse134 (- 1)) 2147483647) (<= .cse134 2147483647) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse135)) (< .cse135 0) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (not (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|))) 2147483647))))) (not (< .cse133 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse136 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse136 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse137 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse137 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse138 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= (+ .cse138 (- 1)) 2147483647) (<= .cse138 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse136))) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse137)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (not (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|))) 2147483647))))))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse139 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse139 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse141 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse140 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse140 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse139))) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse141))) (<= (+ 1 .cse140) 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))) (not (< .cse141 0)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse142 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse142 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse143 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse142))) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse143))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))) (not (< .cse143 0))))) (< .cse142 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse144 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse144 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse145 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (.cse146 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (<= (+ .cse145 (- 1)) 2147483647) (<= .cse145 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse146))) (< .cse146 0) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))) (not (< .cse144 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (or (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse147 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (+ .cse147 (- 1)) 2147483647) (<= .cse147 2147483647) (<= (+ 1 .cse147) 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))) (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse148 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse148 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse149 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= (+ .cse149 (- 1)) 2147483647) (<= .cse149 2147483647) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse148)) (<= (+ 1 .cse149) 2147483647) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (not (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|))) 2147483647)))))))) (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse150 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse150 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse152 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse151 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse150)) (<= (+ .cse151 (- 1)) 2147483647) (<= .cse151 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse152))) (<= (+ 1 .cse151) 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0))))) (< .cse152 0))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (or (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse153 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse153))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))) (not (< .cse153 0))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse154 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse154 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse156 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse155 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse155 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse156))) (<= (+ 1 .cse155) 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))) (< .cse156 0)))) (< .cse154 0)))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse157 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse157 (- 2147483648))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse157)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse158 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse158 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse159 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse158)) (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) (- 1)) 2147483647) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse159)) (< .cse159 0) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (not (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|))) 2147483647))))) (not (< .cse158 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse160 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse160 (- 2147483648))) (< .cse160 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse161 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= .cse161 2147483647) (<= (+ 1 .cse161) 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse162 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse162 (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse162))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse163 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse164 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse163)) (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) (- 1)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse164))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (not (< .cse164 0))))) (not (>= .cse163 (- 2147483648))) (not (< .cse163 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse165 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse165 (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse166 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (+ .cse166 (- 1)) 2147483647) (<= .cse166 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse165))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse167 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse167 (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))) (< .cse167 0) (not (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse168 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse168 (- 2147483648))) (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse169 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (+ .cse169 (- 1)) 2147483647) (<= .cse169 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))) (not (< .cse168 0))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse170 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= (+ .cse170 (- 1)) 2147483647) (<= .cse170 2147483647) (<= (+ 1 .cse170) 2147483647)))) (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648)))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse171 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse171 (- 2147483648))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse172 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= (+ .cse172 (- 1)) 2147483647) (<= .cse172 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse171))))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse173 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse173 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse174 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse174 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse175 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= .cse175 2147483647) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse174)) (<= (+ 1 .cse175) 2147483647) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (not (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|))) 2147483647)))))))) (< .cse173 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse176 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse176 (- 2147483648))) (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0) (< .cse176 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse176))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse177 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse177 (- 2147483648))) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse178 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= .cse178 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse177))) (<= (+ 1 .cse178) 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))) (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse179 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse179 (- 2147483648))) (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0) (< .cse179 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse180 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= .cse180 2147483647) (<= (+ 1 .cse180) 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse181 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse181 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse182 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (.cse183 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (<= (+ .cse182 (- 1)) 2147483647) (<= .cse182 2147483647) (not (<= (+ (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) (- 1)) 2147483647)) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse183)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (not (< .cse183 0))))) (not (< .cse181 0))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse184 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse184 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse185 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse184)) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse185))) (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)))) (not (< .cse185 0))))) (< .cse184 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (or (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse186 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (+ .cse186 (- 1)) 2147483647) (<= .cse186 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (or (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse188 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse187 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (<= (+ .cse187 (- 1)) 2147483647) (<= .cse187 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse188))) (<= (+ 1 .cse187) 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))) (not (< .cse188 0))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int) (v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse189 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse189 (- 2147483648))) (< (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse189))) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse190 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse190 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse191 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (< .cse191 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse192 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse190)) (<= (+ .cse192 (- 1)) 2147483647) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse191)) (<= (+ 1 .cse192) 2147483647) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (not (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|))) 2147483647))))))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse193 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse193 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse194 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse193))) (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse194)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0)) (not (<= (+ 1 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|))) 2147483647)))) (< .cse194 0))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse195 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1))) (or (not (>= .cse195 (- 2147483648))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int)) (let ((.cse197 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (let ((.cse196 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)))) (or (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse195)) (<= (+ .cse196 (- 1)) 2147483647) (not (= 0 (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| .cse197))) (<= (+ 1 .cse196) 2147483647) (not (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#in~n|)) 2147483647)) (not (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0))))) (not (< .cse197 0)))))))) (forall ((v_binomialCoefficient_~k_BEFORE_CALL_23 Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| 0) (<= (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_9| (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) 2147483647))) (not (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| .cse1) (- 2147483648))) (>= (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| (+ (+ v_binomialCoefficient_~k_BEFORE_CALL_23 |c_fact_#in~n|) (- v_binomialCoefficient_~k_BEFORE_CALL_23))) (- 2147483648)))))) is different from true [2023-02-18 23:34:08,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:34:08,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662711599] [2023-02-18 23:34:08,311 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:34:08,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342902017] [2023-02-18 23:34:08,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342902017] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 23:34:08,312 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 23:34:08,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2023-02-18 23:34:08,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414600379] [2023-02-18 23:34:08,312 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 23:34:08,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-18 23:34:08,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:34:08,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-18 23:34:08,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=409, Unknown=3, NotChecked=126, Total=600 [2023-02-18 23:34:08,313 INFO L87 Difference]: Start difference. First operand 483 states and 615 transitions. Second operand has 19 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 18 states have internal predecessors, (56), 8 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-02-18 23:34:08,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:34:08,876 INFO L93 Difference]: Finished difference Result 530 states and 702 transitions. [2023-02-18 23:34:08,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-18 23:34:08,877 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 18 states have internal predecessors, (56), 8 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 87 [2023-02-18 23:34:08,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:34:08,879 INFO L225 Difference]: With dead ends: 530 [2023-02-18 23:34:08,879 INFO L226 Difference]: Without dead ends: 529 [2023-02-18 23:34:08,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=139, Invalid=926, Unknown=3, NotChecked=192, Total=1260 [2023-02-18 23:34:08,880 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 64 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 23:34:08,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 506 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 23:34:08,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2023-02-18 23:34:08,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 495. [2023-02-18 23:34:08,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 385 states have (on average 1.1792207792207792) internal successors, (454), 386 states have internal predecessors, (454), 68 states have call successors, (68), 27 states have call predecessors, (68), 34 states have return successors, (106), 81 states have call predecessors, (106), 68 states have call successors, (106) [2023-02-18 23:34:08,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 628 transitions. [2023-02-18 23:34:08,894 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 628 transitions. Word has length 87 [2023-02-18 23:34:08,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:34:08,894 INFO L495 AbstractCegarLoop]: Abstraction has 495 states and 628 transitions. [2023-02-18 23:34:08,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 18 states have internal predecessors, (56), 8 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-02-18 23:34:08,894 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 628 transitions. [2023-02-18 23:34:08,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-02-18 23:34:08,895 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:34:08,895 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2023-02-18 23:34:08,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-02-18 23:34:09,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-02-18 23:34:09,101 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting binomialCoefficientErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:34:09,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:34:09,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1580168954, now seen corresponding path program 2 times [2023-02-18 23:34:09,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:34:09,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57161330] [2023-02-18 23:34:09,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:09,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:34:09,106 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:34:09,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [156708989] [2023-02-18 23:34:09,116 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 23:34:09,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:09,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:34:09,117 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:34:09,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-02-18 23:34:09,167 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 23:34:09,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:34:09,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-18 23:34:09,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:34:09,253 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 70 proven. 7 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-02-18 23:34:09,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:34:09,345 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 70 proven. 8 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2023-02-18 23:34:09,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:34:09,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57161330] [2023-02-18 23:34:09,345 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:34:09,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156708989] [2023-02-18 23:34:09,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156708989] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:34:09,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:34:09,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 18 [2023-02-18 23:34:09,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5734569] [2023-02-18 23:34:09,347 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:34:09,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-18 23:34:09,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:34:09,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-18 23:34:09,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2023-02-18 23:34:09,349 INFO L87 Difference]: Start difference. First operand 495 states and 628 transitions. Second operand has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 16 states have internal predecessors, (78), 10 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2023-02-18 23:34:09,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:34:09,717 INFO L93 Difference]: Finished difference Result 940 states and 1237 transitions. [2023-02-18 23:34:09,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-18 23:34:09,718 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 16 states have internal predecessors, (78), 10 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) Word has length 97 [2023-02-18 23:34:09,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:34:09,719 INFO L225 Difference]: With dead ends: 940 [2023-02-18 23:34:09,720 INFO L226 Difference]: Without dead ends: 519 [2023-02-18 23:34:09,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 174 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2023-02-18 23:34:09,721 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 90 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 23:34:09,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 622 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 23:34:09,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2023-02-18 23:34:09,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 484. [2023-02-18 23:34:09,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 375 states have (on average 1.1813333333333333) internal successors, (443), 377 states have internal predecessors, (443), 67 states have call successors, (67), 27 states have call predecessors, (67), 34 states have return successors, (119), 79 states have call predecessors, (119), 67 states have call successors, (119) [2023-02-18 23:34:09,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 629 transitions. [2023-02-18 23:34:09,733 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 629 transitions. Word has length 97 [2023-02-18 23:34:09,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:34:09,733 INFO L495 AbstractCegarLoop]: Abstraction has 484 states and 629 transitions. [2023-02-18 23:34:09,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 16 states have internal predecessors, (78), 10 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2023-02-18 23:34:09,734 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 629 transitions. [2023-02-18 23:34:09,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-02-18 23:34:09,734 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:34:09,734 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2023-02-18 23:34:09,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-02-18 23:34:09,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-02-18 23:34:09,939 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:34:09,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:34:09,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1255466727, now seen corresponding path program 1 times [2023-02-18 23:34:09,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:34:09,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431078809] [2023-02-18 23:34:09,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:09,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:34:09,944 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:34:09,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1796161273] [2023-02-18 23:34:09,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:09,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:09,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:34:09,945 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:34:09,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-02-18 23:34:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:34:10,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 23:34:10,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:34:10,075 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2023-02-18 23:34:10,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:34:10,138 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2023-02-18 23:34:10,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:34:10,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431078809] [2023-02-18 23:34:10,139 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:34:10,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796161273] [2023-02-18 23:34:10,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796161273] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:34:10,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:34:10,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-02-18 23:34:10,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855689173] [2023-02-18 23:34:10,139 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:34:10,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 23:34:10,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:34:10,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 23:34:10,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2023-02-18 23:34:10,140 INFO L87 Difference]: Start difference. First operand 484 states and 629 transitions. Second operand has 16 states, 13 states have (on average 5.153846153846154) internal successors, (67), 12 states have internal predecessors, (67), 7 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-02-18 23:34:10,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:34:10,380 INFO L93 Difference]: Finished difference Result 655 states and 849 transitions. [2023-02-18 23:34:10,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-18 23:34:10,381 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 5.153846153846154) internal successors, (67), 12 states have internal predecessors, (67), 7 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 107 [2023-02-18 23:34:10,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:34:10,383 INFO L225 Difference]: With dead ends: 655 [2023-02-18 23:34:10,383 INFO L226 Difference]: Without dead ends: 652 [2023-02-18 23:34:10,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2023-02-18 23:34:10,384 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 142 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 23:34:10,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 448 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 23:34:10,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2023-02-18 23:34:10,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 633. [2023-02-18 23:34:10,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 493 states have (on average 1.1906693711967546) internal successors, (587), 495 states have internal predecessors, (587), 90 states have call successors, (90), 33 states have call predecessors, (90), 42 states have return successors, (158), 104 states have call predecessors, (158), 90 states have call successors, (158) [2023-02-18 23:34:10,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 835 transitions. [2023-02-18 23:34:10,411 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 835 transitions. Word has length 107 [2023-02-18 23:34:10,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:34:10,411 INFO L495 AbstractCegarLoop]: Abstraction has 633 states and 835 transitions. [2023-02-18 23:34:10,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 5.153846153846154) internal successors, (67), 12 states have internal predecessors, (67), 7 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-02-18 23:34:10,411 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 835 transitions. [2023-02-18 23:34:10,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-02-18 23:34:10,413 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:34:10,413 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 7, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2023-02-18 23:34:10,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-02-18 23:34:10,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-02-18 23:34:10,618 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:34:10,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:34:10,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1905506534, now seen corresponding path program 2 times [2023-02-18 23:34:10,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:34:10,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146235322] [2023-02-18 23:34:10,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:10,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:34:10,625 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:34:10,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [84264529] [2023-02-18 23:34:10,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 23:34:10,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:10,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:34:10,627 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:34:10,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-02-18 23:34:10,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 23:34:10,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:34:10,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 23:34:10,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:34:10,685 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2023-02-18 23:34:10,685 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 23:34:10,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:34:10,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146235322] [2023-02-18 23:34:10,686 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:34:10,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84264529] [2023-02-18 23:34:10,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84264529] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:34:10,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:34:10,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 23:34:10,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656627279] [2023-02-18 23:34:10,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:34:10,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 23:34:10,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:34:10,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 23:34:10,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-18 23:34:10,688 INFO L87 Difference]: Start difference. First operand 633 states and 835 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-02-18 23:34:10,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:34:10,745 INFO L93 Difference]: Finished difference Result 1010 states and 1341 transitions. [2023-02-18 23:34:10,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 23:34:10,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 113 [2023-02-18 23:34:10,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:34:10,747 INFO L225 Difference]: With dead ends: 1010 [2023-02-18 23:34:10,747 INFO L226 Difference]: Without dead ends: 551 [2023-02-18 23:34:10,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-18 23:34:10,749 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 23 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 23:34:10,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 205 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 23:34:10,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2023-02-18 23:34:10,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 550. [2023-02-18 23:34:10,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 429 states have (on average 1.17016317016317) internal successors, (502), 431 states have internal predecessors, (502), 75 states have call successors, (75), 30 states have call predecessors, (75), 38 states have return successors, (129), 88 states have call predecessors, (129), 75 states have call successors, (129) [2023-02-18 23:34:10,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 706 transitions. [2023-02-18 23:34:10,763 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 706 transitions. Word has length 113 [2023-02-18 23:34:10,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:34:10,763 INFO L495 AbstractCegarLoop]: Abstraction has 550 states and 706 transitions. [2023-02-18 23:34:10,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-02-18 23:34:10,763 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 706 transitions. [2023-02-18 23:34:10,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-02-18 23:34:10,764 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:34:10,764 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2023-02-18 23:34:10,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2023-02-18 23:34:10,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:10,969 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting factErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:34:10,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:34:10,969 INFO L85 PathProgramCache]: Analyzing trace with hash -622888842, now seen corresponding path program 1 times [2023-02-18 23:34:10,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:34:10,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874464743] [2023-02-18 23:34:10,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:10,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:34:10,974 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:34:10,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2132499038] [2023-02-18 23:34:10,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:10,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:10,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:34:10,976 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:34:10,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-02-18 23:34:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:34:11,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 23:34:11,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:34:11,105 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 48 proven. 9 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2023-02-18 23:34:11,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:34:11,622 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 48 proven. 9 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2023-02-18 23:34:11,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:34:11,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874464743] [2023-02-18 23:34:11,623 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:34:11,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132499038] [2023-02-18 23:34:11,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132499038] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:34:11,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:34:11,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2023-02-18 23:34:11,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074927121] [2023-02-18 23:34:11,624 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:34:11,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-18 23:34:11,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:34:11,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-18 23:34:11,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2023-02-18 23:34:11,625 INFO L87 Difference]: Start difference. First operand 550 states and 706 transitions. Second operand has 20 states, 17 states have (on average 4.529411764705882) internal successors, (77), 16 states have internal predecessors, (77), 9 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-18 23:34:13,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:34:13,592 INFO L93 Difference]: Finished difference Result 970 states and 1256 transitions. [2023-02-18 23:34:13,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-18 23:34:13,593 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 4.529411764705882) internal successors, (77), 16 states have internal predecessors, (77), 9 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 115 [2023-02-18 23:34:13,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:34:13,594 INFO L225 Difference]: With dead ends: 970 [2023-02-18 23:34:13,594 INFO L226 Difference]: Without dead ends: 566 [2023-02-18 23:34:13,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 212 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=139, Invalid=853, Unknown=0, NotChecked=0, Total=992 [2023-02-18 23:34:13,596 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 136 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-02-18 23:34:13,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 721 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-02-18 23:34:13,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2023-02-18 23:34:13,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 552. [2023-02-18 23:34:13,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 432 states have (on average 1.1597222222222223) internal successors, (501), 434 states have internal predecessors, (501), 72 states have call successors, (72), 31 states have call predecessors, (72), 40 states have return successors, (122), 86 states have call predecessors, (122), 72 states have call successors, (122) [2023-02-18 23:34:13,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 695 transitions. [2023-02-18 23:34:13,608 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 695 transitions. Word has length 115 [2023-02-18 23:34:13,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:34:13,609 INFO L495 AbstractCegarLoop]: Abstraction has 552 states and 695 transitions. [2023-02-18 23:34:13,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 4.529411764705882) internal successors, (77), 16 states have internal predecessors, (77), 9 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-18 23:34:13,609 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 695 transitions. [2023-02-18 23:34:13,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-02-18 23:34:13,610 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:34:13,610 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 7, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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-18 23:34:13,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2023-02-18 23:34:13,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-02-18 23:34:13,814 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting factErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:34:13,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:34:13,814 INFO L85 PathProgramCache]: Analyzing trace with hash 343501197, now seen corresponding path program 1 times [2023-02-18 23:34:13,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:34:13,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324659694] [2023-02-18 23:34:13,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:13,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:34:13,820 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:34:13,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [828506212] [2023-02-18 23:34:13,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:13,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:13,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:34:13,821 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:34:13,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-02-18 23:34:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:34:13,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-18 23:34:13,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:34:13,967 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 84 proven. 23 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2023-02-18 23:34:13,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:34:14,606 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 84 proven. 23 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2023-02-18 23:34:14,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:34:14,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324659694] [2023-02-18 23:34:14,606 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:34:14,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828506212] [2023-02-18 23:34:14,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828506212] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:34:14,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:34:14,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 31 [2023-02-18 23:34:14,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490511259] [2023-02-18 23:34:14,607 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:34:14,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-18 23:34:14,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:34:14,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-18 23:34:14,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=893, Unknown=0, NotChecked=0, Total=992 [2023-02-18 23:34:14,609 INFO L87 Difference]: Start difference. First operand 552 states and 695 transitions. Second operand has 32 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 28 states have internal predecessors, (90), 13 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-18 23:34:18,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:34:18,376 INFO L93 Difference]: Finished difference Result 1421 states and 1878 transitions. [2023-02-18 23:34:18,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-02-18 23:34:18,377 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 28 states have internal predecessors, (90), 13 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) Word has length 120 [2023-02-18 23:34:18,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:34:18,380 INFO L225 Difference]: With dead ends: 1421 [2023-02-18 23:34:18,380 INFO L226 Difference]: Without dead ends: 1041 [2023-02-18 23:34:18,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 208 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=324, Invalid=2538, Unknown=0, NotChecked=0, Total=2862 [2023-02-18 23:34:18,382 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 224 mSDsluCounter, 1179 mSDsCounter, 0 mSdLazyCounter, 1857 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 1957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:34:18,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1259 Invalid, 1957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1857 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-02-18 23:34:18,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2023-02-18 23:34:18,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 851. [2023-02-18 23:34:18,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 669 states have (on average 1.201793721973094) internal successors, (804), 669 states have internal predecessors, (804), 122 states have call successors, (122), 42 states have call predecessors, (122), 52 states have return successors, (205), 139 states have call predecessors, (205), 122 states have call successors, (205) [2023-02-18 23:34:18,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1131 transitions. [2023-02-18 23:34:18,404 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1131 transitions. Word has length 120 [2023-02-18 23:34:18,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:34:18,405 INFO L495 AbstractCegarLoop]: Abstraction has 851 states and 1131 transitions. [2023-02-18 23:34:18,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 28 states have internal predecessors, (90), 13 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-18 23:34:18,405 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1131 transitions. [2023-02-18 23:34:18,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-02-18 23:34:18,406 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:34:18,406 INFO L195 NwaCegarLoop]: trace histogram [14, 11, 7, 7, 7, 7, 7, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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-18 23:34:18,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2023-02-18 23:34:18,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-02-18 23:34:18,610 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting factErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:34:18,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:34:18,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1667958899, now seen corresponding path program 2 times [2023-02-18 23:34:18,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:34:18,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594132445] [2023-02-18 23:34:18,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:18,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:34:18,617 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:34:18,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1752433106] [2023-02-18 23:34:18,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 23:34:18,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:18,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:34:18,618 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:34:18,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-02-18 23:34:18,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 23:34:18,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:34:18,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-18 23:34:18,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:34:18,733 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 241 proven. 10 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2023-02-18 23:34:18,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:34:18,789 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 97 proven. 46 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2023-02-18 23:34:18,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:34:18,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594132445] [2023-02-18 23:34:18,790 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:34:18,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752433106] [2023-02-18 23:34:18,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752433106] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:34:18,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:34:18,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2023-02-18 23:34:18,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620419373] [2023-02-18 23:34:18,795 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:34:18,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-18 23:34:18,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:34:18,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-18 23:34:18,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-02-18 23:34:18,800 INFO L87 Difference]: Start difference. First operand 851 states and 1131 transitions. Second operand has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 11 states have internal predecessors, (60), 8 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-18 23:34:18,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:34:18,998 INFO L93 Difference]: Finished difference Result 1638 states and 2192 transitions. [2023-02-18 23:34:18,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-18 23:34:18,999 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 11 states have internal predecessors, (60), 8 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 140 [2023-02-18 23:34:18,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:34:19,005 INFO L225 Difference]: With dead ends: 1638 [2023-02-18 23:34:19,005 INFO L226 Difference]: Without dead ends: 885 [2023-02-18 23:34:19,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 254 SyntacticMatches, 12 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2023-02-18 23:34:19,007 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 87 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:34:19,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 516 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:34:19,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2023-02-18 23:34:19,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 859. [2023-02-18 23:34:19,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 674 states have (on average 1.198813056379822) internal successors, (808), 676 states have internal predecessors, (808), 123 states have call successors, (123), 44 states have call predecessors, (123), 54 states have return successors, (202), 138 states have call predecessors, (202), 123 states have call successors, (202) [2023-02-18 23:34:19,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1133 transitions. [2023-02-18 23:34:19,035 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1133 transitions. Word has length 140 [2023-02-18 23:34:19,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:34:19,036 INFO L495 AbstractCegarLoop]: Abstraction has 859 states and 1133 transitions. [2023-02-18 23:34:19,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 11 states have internal predecessors, (60), 8 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-18 23:34:19,036 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1133 transitions. [2023-02-18 23:34:19,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-02-18 23:34:19,037 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:34:19,037 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1] [2023-02-18 23:34:19,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2023-02-18 23:34:19,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-02-18 23:34:19,241 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting binomialCoefficientErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:34:19,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:34:19,242 INFO L85 PathProgramCache]: Analyzing trace with hash -250945720, now seen corresponding path program 1 times [2023-02-18 23:34:19,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:34:19,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296493686] [2023-02-18 23:34:19,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:19,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:34:19,247 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:34:19,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [11710778] [2023-02-18 23:34:19,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:19,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:19,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:34:19,248 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:34:19,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-02-18 23:34:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:34:19,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-18 23:34:19,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:34:19,317 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2023-02-18 23:34:19,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:34:19,361 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2023-02-18 23:34:19,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:34:19,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296493686] [2023-02-18 23:34:19,362 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:34:19,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11710778] [2023-02-18 23:34:19,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11710778] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:34:19,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:34:19,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2023-02-18 23:34:19,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724032378] [2023-02-18 23:34:19,362 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:34:19,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 23:34:19,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:34:19,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 23:34:19,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-02-18 23:34:19,364 INFO L87 Difference]: Start difference. First operand 859 states and 1133 transitions. Second operand has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 12 states have internal predecessors, (67), 7 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2023-02-18 23:34:19,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:34:19,523 INFO L93 Difference]: Finished difference Result 866 states and 1133 transitions. [2023-02-18 23:34:19,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-18 23:34:19,523 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 12 states have internal predecessors, (67), 7 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 126 [2023-02-18 23:34:19,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:34:19,527 INFO L225 Difference]: With dead ends: 866 [2023-02-18 23:34:19,527 INFO L226 Difference]: Without dead ends: 865 [2023-02-18 23:34:19,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2023-02-18 23:34:19,528 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 124 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:34:19,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 383 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:34:19,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2023-02-18 23:34:19,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 859. [2023-02-18 23:34:19,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 674 states have (on average 1.1943620178041543) internal successors, (805), 676 states have internal predecessors, (805), 123 states have call successors, (123), 44 states have call predecessors, (123), 54 states have return successors, (202), 138 states have call predecessors, (202), 123 states have call successors, (202) [2023-02-18 23:34:19,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1130 transitions. [2023-02-18 23:34:19,572 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1130 transitions. Word has length 126 [2023-02-18 23:34:19,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:34:19,573 INFO L495 AbstractCegarLoop]: Abstraction has 859 states and 1130 transitions. [2023-02-18 23:34:19,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 12 states have internal predecessors, (67), 7 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2023-02-18 23:34:19,573 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1130 transitions. [2023-02-18 23:34:19,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-02-18 23:34:19,574 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:34:19,574 INFO L195 NwaCegarLoop]: trace histogram [12, 10, 7, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2023-02-18 23:34:19,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2023-02-18 23:34:19,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:19,778 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting factErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:34:19,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:34:19,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1285538565, now seen corresponding path program 2 times [2023-02-18 23:34:19,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:34:19,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719011919] [2023-02-18 23:34:19,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:19,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:34:19,786 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:34:19,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [549236067] [2023-02-18 23:34:19,787 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 23:34:19,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:19,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:34:19,788 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:34:19,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2023-02-18 23:34:19,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 23:34:19,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:34:19,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 23:34:19,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:34:19,872 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 146 proven. 7 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-02-18 23:34:19,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:34:19,908 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 62 proven. 21 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-02-18 23:34:19,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:34:19,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719011919] [2023-02-18 23:34:19,909 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:34:19,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549236067] [2023-02-18 23:34:19,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549236067] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:34:19,909 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:34:19,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2023-02-18 23:34:19,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862796871] [2023-02-18 23:34:19,909 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:34:19,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 23:34:19,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:34:19,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 23:34:19,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-02-18 23:34:19,911 INFO L87 Difference]: Start difference. First operand 859 states and 1130 transitions. Second operand has 11 states, 10 states have (on average 5.7) internal successors, (57), 8 states have internal predecessors, (57), 6 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-02-18 23:34:20,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:34:20,064 INFO L93 Difference]: Finished difference Result 1501 states and 2014 transitions. [2023-02-18 23:34:20,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 23:34:20,076 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 8 states have internal predecessors, (57), 6 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 130 [2023-02-18 23:34:20,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:34:20,079 INFO L225 Difference]: With dead ends: 1501 [2023-02-18 23:34:20,079 INFO L226 Difference]: Without dead ends: 855 [2023-02-18 23:34:20,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 242 SyntacticMatches, 8 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2023-02-18 23:34:20,081 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 59 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:34:20,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 475 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:34:20,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2023-02-18 23:34:20,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 848. [2023-02-18 23:34:20,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 665 states have (on average 1.193984962406015) internal successors, (794), 667 states have internal predecessors, (794), 122 states have call successors, (122), 44 states have call predecessors, (122), 53 states have return successors, (199), 136 states have call predecessors, (199), 122 states have call successors, (199) [2023-02-18 23:34:20,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1115 transitions. [2023-02-18 23:34:20,103 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1115 transitions. Word has length 130 [2023-02-18 23:34:20,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:34:20,103 INFO L495 AbstractCegarLoop]: Abstraction has 848 states and 1115 transitions. [2023-02-18 23:34:20,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 8 states have internal predecessors, (57), 6 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-02-18 23:34:20,104 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1115 transitions. [2023-02-18 23:34:20,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-02-18 23:34:20,104 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:34:20,104 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 9, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-18 23:34:20,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2023-02-18 23:34:20,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2023-02-18 23:34:20,313 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting factErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:34:20,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:34:20,314 INFO L85 PathProgramCache]: Analyzing trace with hash 477473427, now seen corresponding path program 3 times [2023-02-18 23:34:20,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:34:20,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230768704] [2023-02-18 23:34:20,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:20,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:34:20,320 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:34:20,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1635294840] [2023-02-18 23:34:20,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 23:34:20,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:20,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:34:20,321 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:34:20,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-02-18 23:34:20,359 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-02-18 23:34:20,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:34:20,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-18 23:34:20,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:34:20,373 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2023-02-18 23:34:20,373 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 23:34:20,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:34:20,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230768704] [2023-02-18 23:34:20,373 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:34:20,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635294840] [2023-02-18 23:34:20,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635294840] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:34:20,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:34:20,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 23:34:20,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827204111] [2023-02-18 23:34:20,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:34:20,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 23:34:20,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:34:20,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 23:34:20,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-18 23:34:20,376 INFO L87 Difference]: Start difference. First operand 848 states and 1115 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-18 23:34:20,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:34:20,478 INFO L93 Difference]: Finished difference Result 872 states and 1142 transitions. [2023-02-18 23:34:20,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 23:34:20,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 134 [2023-02-18 23:34:20,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:34:20,485 INFO L225 Difference]: With dead ends: 872 [2023-02-18 23:34:20,485 INFO L226 Difference]: Without dead ends: 871 [2023-02-18 23:34:20,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-02-18 23:34:20,492 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 21 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:34:20,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 207 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:34:20,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2023-02-18 23:34:20,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 857. [2023-02-18 23:34:20,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 674 states have (on average 1.1899109792284865) internal successors, (802), 673 states have internal predecessors, (802), 122 states have call successors, (122), 44 states have call predecessors, (122), 53 states have return successors, (199), 139 states have call predecessors, (199), 122 states have call successors, (199) [2023-02-18 23:34:20,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1123 transitions. [2023-02-18 23:34:20,516 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1123 transitions. Word has length 134 [2023-02-18 23:34:20,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:34:20,518 INFO L495 AbstractCegarLoop]: Abstraction has 857 states and 1123 transitions. [2023-02-18 23:34:20,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-18 23:34:20,518 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1123 transitions. [2023-02-18 23:34:20,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-02-18 23:34:20,519 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:34:20,519 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:34:20,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2023-02-18 23:34:20,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:20,723 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting binomialCoefficientErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:34:20,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:34:20,724 INFO L85 PathProgramCache]: Analyzing trace with hash -820050261, now seen corresponding path program 1 times [2023-02-18 23:34:20,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:34:20,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096751772] [2023-02-18 23:34:20,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:20,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:34:20,728 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:34:20,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [195997325] [2023-02-18 23:34:20,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:20,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:20,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:34:20,730 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:34:20,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2023-02-18 23:34:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:34:20,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-18 23:34:20,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:34:20,812 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2023-02-18 23:34:20,812 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 23:34:20,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:34:20,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096751772] [2023-02-18 23:34:20,813 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:34:20,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195997325] [2023-02-18 23:34:20,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195997325] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:34:20,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:34:20,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-18 23:34:20,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385366644] [2023-02-18 23:34:20,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:34:20,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 23:34:20,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:34:20,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 23:34:20,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-02-18 23:34:20,815 INFO L87 Difference]: Start difference. First operand 857 states and 1123 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2023-02-18 23:34:21,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:34:21,015 INFO L93 Difference]: Finished difference Result 1487 states and 1982 transitions. [2023-02-18 23:34:21,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 23:34:21,024 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 136 [2023-02-18 23:34:21,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:34:21,028 INFO L225 Difference]: With dead ends: 1487 [2023-02-18 23:34:21,028 INFO L226 Difference]: Without dead ends: 852 [2023-02-18 23:34:21,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-02-18 23:34:21,030 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 55 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 23:34:21,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 352 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 23:34:21,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2023-02-18 23:34:21,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 846. [2023-02-18 23:34:21,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 665 states have (on average 1.1924812030075187) internal successors, (793), 665 states have internal predecessors, (793), 120 states have call successors, (120), 44 states have call predecessors, (120), 53 states have return successors, (192), 136 states have call predecessors, (192), 120 states have call successors, (192) [2023-02-18 23:34:21,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1105 transitions. [2023-02-18 23:34:21,055 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1105 transitions. Word has length 136 [2023-02-18 23:34:21,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:34:21,055 INFO L495 AbstractCegarLoop]: Abstraction has 846 states and 1105 transitions. [2023-02-18 23:34:21,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2023-02-18 23:34:21,055 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1105 transitions. [2023-02-18 23:34:21,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-02-18 23:34:21,056 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:34:21,056 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 9, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:34:21,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2023-02-18 23:34:21,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2023-02-18 23:34:21,261 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting binomialCoefficientErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:34:21,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:34:21,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1099083764, now seen corresponding path program 1 times [2023-02-18 23:34:21,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:34:21,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794345189] [2023-02-18 23:34:21,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:21,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:34:21,266 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:34:21,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1967312298] [2023-02-18 23:34:21,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:21,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:21,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:34:21,281 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:34:21,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2023-02-18 23:34:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:34:21,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-18 23:34:21,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:34:21,403 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 234 proven. 2 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2023-02-18 23:34:21,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:34:21,483 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 96 proven. 27 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-02-18 23:34:21,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:34:21,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794345189] [2023-02-18 23:34:21,483 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:34:21,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967312298] [2023-02-18 23:34:21,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967312298] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:34:21,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:34:21,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 14 [2023-02-18 23:34:21,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662927634] [2023-02-18 23:34:21,484 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:34:21,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 23:34:21,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:34:21,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 23:34:21,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-02-18 23:34:21,486 INFO L87 Difference]: Start difference. First operand 846 states and 1105 transitions. Second operand has 14 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 8 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2023-02-18 23:34:21,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:34:21,701 INFO L93 Difference]: Finished difference Result 1594 states and 2120 transitions. [2023-02-18 23:34:21,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 23:34:21,701 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 8 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) Word has length 141 [2023-02-18 23:34:21,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:34:21,704 INFO L225 Difference]: With dead ends: 1594 [2023-02-18 23:34:21,704 INFO L226 Difference]: Without dead ends: 814 [2023-02-18 23:34:21,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 258 SyntacticMatches, 11 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2023-02-18 23:34:21,707 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 70 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 23:34:21,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 387 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 23:34:21,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2023-02-18 23:34:21,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 794. [2023-02-18 23:34:21,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 622 states have (on average 1.1913183279742765) internal successors, (741), 627 states have internal predecessors, (741), 112 states have call successors, (112), 44 states have call predecessors, (112), 52 states have return successors, (166), 122 states have call predecessors, (166), 112 states have call successors, (166) [2023-02-18 23:34:21,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1019 transitions. [2023-02-18 23:34:21,728 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1019 transitions. Word has length 141 [2023-02-18 23:34:21,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:34:21,728 INFO L495 AbstractCegarLoop]: Abstraction has 794 states and 1019 transitions. [2023-02-18 23:34:21,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 8 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2023-02-18 23:34:21,729 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1019 transitions. [2023-02-18 23:34:21,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-02-18 23:34:21,729 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:34:21,730 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 9, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:34:21,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2023-02-18 23:34:21,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:21,934 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting binomialCoefficientErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:34:21,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:34:21,935 INFO L85 PathProgramCache]: Analyzing trace with hash -175263733, now seen corresponding path program 2 times [2023-02-18 23:34:21,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:34:21,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813006034] [2023-02-18 23:34:21,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:21,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:34:21,941 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:34:21,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1657136681] [2023-02-18 23:34:21,942 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 23:34:21,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:21,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:34:21,959 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:34:21,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2023-02-18 23:34:22,035 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 23:34:22,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:34:22,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 23:34:22,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:34:22,149 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2023-02-18 23:34:22,149 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 23:34:22,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:34:22,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813006034] [2023-02-18 23:34:22,150 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:34:22,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657136681] [2023-02-18 23:34:22,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657136681] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:34:22,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:34:22,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-18 23:34:22,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670004052] [2023-02-18 23:34:22,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:34:22,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 23:34:22,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:34:22,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 23:34:22,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-02-18 23:34:22,151 INFO L87 Difference]: Start difference. First operand 794 states and 1019 transitions. Second operand has 9 states, 7 states have (on average 7.714285714285714) internal successors, (54), 9 states have internal predecessors, (54), 4 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-18 23:34:22,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:34:22,285 INFO L93 Difference]: Finished difference Result 794 states and 1019 transitions. [2023-02-18 23:34:22,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 23:34:22,285 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.714285714285714) internal successors, (54), 9 states have internal predecessors, (54), 4 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 146 [2023-02-18 23:34:22,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:34:22,288 INFO L225 Difference]: With dead ends: 794 [2023-02-18 23:34:22,289 INFO L226 Difference]: Without dead ends: 793 [2023-02-18 23:34:22,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-02-18 23:34:22,289 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 9 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:34:22,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 198 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:34:22,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2023-02-18 23:34:22,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 782. [2023-02-18 23:34:22,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 613 states have (on average 1.169657422512235) internal successors, (717), 618 states have internal predecessors, (717), 110 states have call successors, (110), 44 states have call predecessors, (110), 52 states have return successors, (161), 119 states have call predecessors, (161), 110 states have call successors, (161) [2023-02-18 23:34:22,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 988 transitions. [2023-02-18 23:34:22,316 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 988 transitions. Word has length 146 [2023-02-18 23:34:22,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:34:22,316 INFO L495 AbstractCegarLoop]: Abstraction has 782 states and 988 transitions. [2023-02-18 23:34:22,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.714285714285714) internal successors, (54), 9 states have internal predecessors, (54), 4 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-18 23:34:22,316 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 988 transitions. [2023-02-18 23:34:22,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-02-18 23:34:22,317 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:34:22,318 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 9, 6, 6, 6, 6, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-18 23:34:22,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2023-02-18 23:34:22,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2023-02-18 23:34:22,522 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting factErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:34:22,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:34:22,522 INFO L85 PathProgramCache]: Analyzing trace with hash 959118035, now seen corresponding path program 4 times [2023-02-18 23:34:22,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:34:22,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038800505] [2023-02-18 23:34:22,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:22,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:34:22,538 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:34:22,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1365407263] [2023-02-18 23:34:22,538 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-18 23:34:22,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:22,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:34:22,553 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:34:22,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2023-02-18 23:34:22,618 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-18 23:34:22,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:34:22,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-18 23:34:22,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:34:22,804 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 202 proven. 79 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2023-02-18 23:34:22,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:34:22,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:34:22,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038800505] [2023-02-18 23:34:22,868 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:34:22,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365407263] [2023-02-18 23:34:22,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365407263] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 23:34:22,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 23:34:22,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2023-02-18 23:34:22,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078566957] [2023-02-18 23:34:22,868 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 23:34:22,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-18 23:34:22,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:34:22,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-18 23:34:22,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2023-02-18 23:34:22,869 INFO L87 Difference]: Start difference. First operand 782 states and 988 transitions. Second operand has 20 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 19 states have internal predecessors, (71), 8 states have call successors, (13), 3 states have call predecessors, (13), 6 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2023-02-18 23:34:23,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:34:23,420 INFO L93 Difference]: Finished difference Result 1560 states and 2042 transitions. [2023-02-18 23:34:23,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-18 23:34:23,421 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 19 states have internal predecessors, (71), 8 states have call successors, (13), 3 states have call predecessors, (13), 6 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) Word has length 154 [2023-02-18 23:34:23,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:34:23,425 INFO L225 Difference]: With dead ends: 1560 [2023-02-18 23:34:23,425 INFO L226 Difference]: Without dead ends: 884 [2023-02-18 23:34:23,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 136 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=219, Invalid=1113, Unknown=0, NotChecked=0, Total=1332 [2023-02-18 23:34:23,427 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 130 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 23:34:23,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 493 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 23:34:23,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2023-02-18 23:34:23,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 651. [2023-02-18 23:34:23,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 508 states have (on average 1.1318897637795275) internal successors, (575), 512 states have internal predecessors, (575), 86 states have call successors, (86), 41 states have call predecessors, (86), 50 states have return successors, (137), 97 states have call predecessors, (137), 86 states have call successors, (137) [2023-02-18 23:34:23,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 798 transitions. [2023-02-18 23:34:23,445 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 798 transitions. Word has length 154 [2023-02-18 23:34:23,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:34:23,446 INFO L495 AbstractCegarLoop]: Abstraction has 651 states and 798 transitions. [2023-02-18 23:34:23,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 19 states have internal predecessors, (71), 8 states have call successors, (13), 3 states have call predecessors, (13), 6 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2023-02-18 23:34:23,446 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 798 transitions. [2023-02-18 23:34:23,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-02-18 23:34:23,447 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:34:23,447 INFO L195 NwaCegarLoop]: trace histogram [17, 14, 9, 8, 8, 8, 8, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2023-02-18 23:34:23,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2023-02-18 23:34:23,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2023-02-18 23:34:23,651 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting factErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:34:23,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:34:23,652 INFO L85 PathProgramCache]: Analyzing trace with hash 200822780, now seen corresponding path program 3 times [2023-02-18 23:34:23,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:34:23,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754299005] [2023-02-18 23:34:23,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:23,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:34:23,657 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:34:23,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2109023109] [2023-02-18 23:34:23,657 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 23:34:23,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:23,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:34:23,658 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:34:23,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2023-02-18 23:34:23,709 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-18 23:34:23,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:34:23,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-18 23:34:23,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:34:23,748 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 174 proven. 17 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2023-02-18 23:34:23,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:34:23,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:34:23,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754299005] [2023-02-18 23:34:23,967 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:34:23,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109023109] [2023-02-18 23:34:23,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109023109] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 23:34:23,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 23:34:23,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2023-02-18 23:34:23,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098811180] [2023-02-18 23:34:23,967 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 23:34:23,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 23:34:23,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:34:23,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 23:34:23,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-02-18 23:34:23,968 INFO L87 Difference]: Start difference. First operand 651 states and 798 transitions. Second operand has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2023-02-18 23:34:24,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:34:24,350 INFO L93 Difference]: Finished difference Result 708 states and 895 transitions. [2023-02-18 23:34:24,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 23:34:24,350 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 169 [2023-02-18 23:34:24,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:34:24,357 INFO L225 Difference]: With dead ends: 708 [2023-02-18 23:34:24,357 INFO L226 Difference]: Without dead ends: 707 [2023-02-18 23:34:24,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2023-02-18 23:34:24,358 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 17 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 23:34:24,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 284 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 23:34:24,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2023-02-18 23:34:24,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 672. [2023-02-18 23:34:24,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 526 states have (on average 1.1273764258555132) internal successors, (593), 528 states have internal predecessors, (593), 86 states have call successors, (86), 41 states have call predecessors, (86), 53 states have return successors, (146), 102 states have call predecessors, (146), 86 states have call successors, (146) [2023-02-18 23:34:24,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 825 transitions. [2023-02-18 23:34:24,375 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 825 transitions. Word has length 169 [2023-02-18 23:34:24,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:34:24,375 INFO L495 AbstractCegarLoop]: Abstraction has 672 states and 825 transitions. [2023-02-18 23:34:24,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2023-02-18 23:34:24,375 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 825 transitions. [2023-02-18 23:34:24,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-02-18 23:34:24,377 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:34:24,377 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 9, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:34:24,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2023-02-18 23:34:24,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2023-02-18 23:34:24,587 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:34:24,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:34:24,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1657713853, now seen corresponding path program 1 times [2023-02-18 23:34:24,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:34:24,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647229695] [2023-02-18 23:34:24,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:24,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:34:24,598 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:34:24,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1967102462] [2023-02-18 23:34:24,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:24,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:24,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:34:24,600 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:34:24,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2023-02-18 23:34:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:34:24,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-18 23:34:24,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:34:24,710 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 141 proven. 2 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2023-02-18 23:34:24,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:34:24,796 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 141 proven. 3 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2023-02-18 23:34:24,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:34:24,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647229695] [2023-02-18 23:34:24,796 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:34:24,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967102462] [2023-02-18 23:34:24,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967102462] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:34:24,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:34:24,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 21 [2023-02-18 23:34:24,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363318146] [2023-02-18 23:34:24,797 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:34:24,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-18 23:34:24,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:34:24,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-18 23:34:24,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2023-02-18 23:34:24,798 INFO L87 Difference]: Start difference. First operand 672 states and 825 transitions. Second operand has 21 states, 21 states have (on average 4.285714285714286) internal successors, (90), 21 states have internal predecessors, (90), 11 states have call successors, (18), 1 states have call predecessors, (18), 4 states have return successors, (18), 10 states have call predecessors, (18), 11 states have call successors, (18) [2023-02-18 23:34:25,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:34:25,008 INFO L93 Difference]: Finished difference Result 1327 states and 1641 transitions. [2023-02-18 23:34:25,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-18 23:34:25,009 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.285714285714286) internal successors, (90), 21 states have internal predecessors, (90), 11 states have call successors, (18), 1 states have call predecessors, (18), 4 states have return successors, (18), 10 states have call predecessors, (18), 11 states have call successors, (18) Word has length 157 [2023-02-18 23:34:25,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:34:25,016 INFO L225 Difference]: With dead ends: 1327 [2023-02-18 23:34:25,016 INFO L226 Difference]: Without dead ends: 735 [2023-02-18 23:34:25,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 287 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2023-02-18 23:34:25,018 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 99 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 23:34:25,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 207 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 23:34:25,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2023-02-18 23:34:25,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 675. [2023-02-18 23:34:25,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 529 states have (on average 1.1190926275992439) internal successors, (592), 530 states have internal predecessors, (592), 86 states have call successors, (86), 41 states have call predecessors, (86), 53 states have return successors, (140), 103 states have call predecessors, (140), 86 states have call successors, (140) [2023-02-18 23:34:25,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 818 transitions. [2023-02-18 23:34:25,035 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 818 transitions. Word has length 157 [2023-02-18 23:34:25,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:34:25,036 INFO L495 AbstractCegarLoop]: Abstraction has 675 states and 818 transitions. [2023-02-18 23:34:25,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.285714285714286) internal successors, (90), 21 states have internal predecessors, (90), 11 states have call successors, (18), 1 states have call predecessors, (18), 4 states have return successors, (18), 10 states have call predecessors, (18), 11 states have call successors, (18) [2023-02-18 23:34:25,036 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 818 transitions. [2023-02-18 23:34:25,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-02-18 23:34:25,037 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:34:25,037 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 9, 7, 7, 7, 7, 7, 7, 7, 6, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2023-02-18 23:34:25,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2023-02-18 23:34:25,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2023-02-18 23:34:25,243 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting factErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:34:25,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:34:25,243 INFO L85 PathProgramCache]: Analyzing trace with hash -113550532, now seen corresponding path program 4 times [2023-02-18 23:34:25,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:34:25,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934007022] [2023-02-18 23:34:25,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:25,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:34:25,248 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:34:25,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [945567078] [2023-02-18 23:34:25,248 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-18 23:34:25,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:25,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:34:25,250 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:34:25,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2023-02-18 23:34:25,303 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-18 23:34:25,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:34:25,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-18 23:34:25,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:34:25,362 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 177 proven. 81 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2023-02-18 23:34:25,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:34:25,439 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 177 proven. 82 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2023-02-18 23:34:25,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:34:25,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934007022] [2023-02-18 23:34:25,440 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:34:25,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945567078] [2023-02-18 23:34:25,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945567078] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:34:25,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:34:25,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 16 [2023-02-18 23:34:25,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162654406] [2023-02-18 23:34:25,441 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:34:25,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 23:34:25,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:34:25,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 23:34:25,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2023-02-18 23:34:25,442 INFO L87 Difference]: Start difference. First operand 675 states and 818 transitions. Second operand has 16 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 9 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (14), 6 states have call predecessors, (14), 8 states have call successors, (14) [2023-02-18 23:34:25,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:34:25,746 INFO L93 Difference]: Finished difference Result 1238 states and 1526 transitions. [2023-02-18 23:34:25,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-18 23:34:25,749 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 9 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (14), 6 states have call predecessors, (14), 8 states have call successors, (14) Word has length 169 [2023-02-18 23:34:25,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:34:25,752 INFO L225 Difference]: With dead ends: 1238 [2023-02-18 23:34:25,752 INFO L226 Difference]: Without dead ends: 771 [2023-02-18 23:34:25,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 312 SyntacticMatches, 12 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2023-02-18 23:34:25,753 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 118 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 23:34:25,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 482 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 23:34:25,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2023-02-18 23:34:25,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 691. [2023-02-18 23:34:25,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 541 states have (on average 1.1182994454713493) internal successors, (605), 542 states have internal predecessors, (605), 89 states have call successors, (89), 42 states have call predecessors, (89), 54 states have return successors, (144), 106 states have call predecessors, (144), 89 states have call successors, (144) [2023-02-18 23:34:25,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 838 transitions. [2023-02-18 23:34:25,773 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 838 transitions. Word has length 169 [2023-02-18 23:34:25,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:34:25,773 INFO L495 AbstractCegarLoop]: Abstraction has 691 states and 838 transitions. [2023-02-18 23:34:25,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 9 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (14), 6 states have call predecessors, (14), 8 states have call successors, (14) [2023-02-18 23:34:25,774 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 838 transitions. [2023-02-18 23:34:25,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-02-18 23:34:25,774 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:34:25,775 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 9, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:34:25,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2023-02-18 23:34:25,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2023-02-18 23:34:25,980 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:34:25,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:34:25,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1806780323, now seen corresponding path program 2 times [2023-02-18 23:34:25,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:34:25,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086408285] [2023-02-18 23:34:25,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:25,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:34:25,987 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:34:25,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1220970079] [2023-02-18 23:34:25,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 23:34:25,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:25,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:34:25,989 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:34:25,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2023-02-18 23:34:26,050 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 23:34:26,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:34:26,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-18 23:34:26,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:34:26,085 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2023-02-18 23:34:26,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:34:26,129 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2023-02-18 23:34:26,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:34:26,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086408285] [2023-02-18 23:34:26,130 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:34:26,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220970079] [2023-02-18 23:34:26,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220970079] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:34:26,130 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:34:26,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2023-02-18 23:34:26,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25636599] [2023-02-18 23:34:26,131 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:34:26,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 23:34:26,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:34:26,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 23:34:26,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-02-18 23:34:26,132 INFO L87 Difference]: Start difference. First operand 691 states and 838 transitions. Second operand has 14 states, 13 states have (on average 4.769230769230769) internal successors, (62), 14 states have internal predecessors, (62), 7 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2023-02-18 23:34:26,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:34:26,249 INFO L93 Difference]: Finished difference Result 889 states and 1095 transitions. [2023-02-18 23:34:26,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-18 23:34:26,249 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.769230769230769) internal successors, (62), 14 states have internal predecessors, (62), 7 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) Word has length 167 [2023-02-18 23:34:26,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:34:26,252 INFO L225 Difference]: With dead ends: 889 [2023-02-18 23:34:26,252 INFO L226 Difference]: Without dead ends: 888 [2023-02-18 23:34:26,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2023-02-18 23:34:26,253 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 65 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:34:26,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 396 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:34:26,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2023-02-18 23:34:26,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 824. [2023-02-18 23:34:26,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 651 states have (on average 1.1259600614439325) internal successors, (733), 655 states have internal predecessors, (733), 112 states have call successors, (112), 42 states have call predecessors, (112), 54 states have return successors, (167), 126 states have call predecessors, (167), 112 states have call successors, (167) [2023-02-18 23:34:26,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1012 transitions. [2023-02-18 23:34:26,275 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1012 transitions. Word has length 167 [2023-02-18 23:34:26,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:34:26,276 INFO L495 AbstractCegarLoop]: Abstraction has 824 states and 1012 transitions. [2023-02-18 23:34:26,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.769230769230769) internal successors, (62), 14 states have internal predecessors, (62), 7 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2023-02-18 23:34:26,276 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1012 transitions. [2023-02-18 23:34:26,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-02-18 23:34:26,277 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:34:26,277 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 10, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:34:26,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2023-02-18 23:34:26,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:26,478 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:34:26,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:34:26,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1318755682, now seen corresponding path program 3 times [2023-02-18 23:34:26,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:34:26,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987893081] [2023-02-18 23:34:26,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:26,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:34:26,483 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:34:26,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [795485922] [2023-02-18 23:34:26,484 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 23:34:26,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:26,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:34:26,486 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:34:26,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2023-02-18 23:34:26,535 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-02-18 23:34:26,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:34:26,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 23:34:26,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:34:26,561 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2023-02-18 23:34:26,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:34:26,609 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2023-02-18 23:34:26,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:34:26,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987893081] [2023-02-18 23:34:26,609 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:34:26,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795485922] [2023-02-18 23:34:26,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795485922] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:34:26,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:34:26,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-02-18 23:34:26,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654204680] [2023-02-18 23:34:26,610 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:34:26,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 23:34:26,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:34:26,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 23:34:26,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2023-02-18 23:34:26,613 INFO L87 Difference]: Start difference. First operand 824 states and 1012 transitions. Second operand has 16 states, 15 states have (on average 4.466666666666667) internal successors, (67), 12 states have internal predecessors, (67), 7 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-18 23:34:26,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:34:26,861 INFO L93 Difference]: Finished difference Result 934 states and 1150 transitions. [2023-02-18 23:34:26,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-18 23:34:26,861 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.466666666666667) internal successors, (67), 12 states have internal predecessors, (67), 7 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 177 [2023-02-18 23:34:26,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:34:26,864 INFO L225 Difference]: With dead ends: 934 [2023-02-18 23:34:26,864 INFO L226 Difference]: Without dead ends: 933 [2023-02-18 23:34:26,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2023-02-18 23:34:26,866 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 150 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 23:34:26,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 385 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 23:34:26,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2023-02-18 23:34:26,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 923. [2023-02-18 23:34:26,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 729 states have (on average 1.1289437585733881) internal successors, (823), 731 states have internal predecessors, (823), 123 states have call successors, (123), 47 states have call predecessors, (123), 64 states have return successors, (199), 144 states have call predecessors, (199), 123 states have call successors, (199) [2023-02-18 23:34:26,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1145 transitions. [2023-02-18 23:34:26,894 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1145 transitions. Word has length 177 [2023-02-18 23:34:26,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:34:26,894 INFO L495 AbstractCegarLoop]: Abstraction has 923 states and 1145 transitions. [2023-02-18 23:34:26,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.466666666666667) internal successors, (67), 12 states have internal predecessors, (67), 7 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-18 23:34:26,894 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1145 transitions. [2023-02-18 23:34:26,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2023-02-18 23:34:26,896 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:34:26,896 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 11, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:34:26,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2023-02-18 23:34:27,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2023-02-18 23:34:27,104 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting binomialCoefficientErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:34:27,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:34:27,105 INFO L85 PathProgramCache]: Analyzing trace with hash 967079394, now seen corresponding path program 2 times [2023-02-18 23:34:27,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:34:27,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191490898] [2023-02-18 23:34:27,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:27,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:34:27,111 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:34:27,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1751568513] [2023-02-18 23:34:27,111 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 23:34:27,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:27,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:34:27,112 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:34:27,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2023-02-18 23:34:27,183 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 23:34:27,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:34:27,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-18 23:34:27,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:34:27,213 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 24 proven. 20 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2023-02-18 23:34:27,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:34:27,270 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 24 proven. 20 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2023-02-18 23:34:27,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:34:27,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191490898] [2023-02-18 23:34:27,270 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:34:27,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751568513] [2023-02-18 23:34:27,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751568513] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:34:27,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:34:27,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-02-18 23:34:27,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303985342] [2023-02-18 23:34:27,271 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:34:27,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-18 23:34:27,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:34:27,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-18 23:34:27,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2023-02-18 23:34:27,272 INFO L87 Difference]: Start difference. First operand 923 states and 1145 transitions. Second operand has 18 states, 17 states have (on average 4.647058823529412) internal successors, (79), 16 states have internal predecessors, (79), 9 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2023-02-18 23:34:27,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:34:27,520 INFO L93 Difference]: Finished difference Result 929 states and 1146 transitions. [2023-02-18 23:34:27,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-18 23:34:27,521 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.647058823529412) internal successors, (79), 16 states have internal predecessors, (79), 9 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 180 [2023-02-18 23:34:27,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:34:27,525 INFO L225 Difference]: With dead ends: 929 [2023-02-18 23:34:27,525 INFO L226 Difference]: Without dead ends: 928 [2023-02-18 23:34:27,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2023-02-18 23:34:27,526 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 113 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 23:34:27,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 452 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 23:34:27,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2023-02-18 23:34:27,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 923. [2023-02-18 23:34:27,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 729 states have (on average 1.1179698216735254) internal successors, (815), 731 states have internal predecessors, (815), 123 states have call successors, (123), 47 states have call predecessors, (123), 64 states have return successors, (199), 144 states have call predecessors, (199), 123 states have call successors, (199) [2023-02-18 23:34:27,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1137 transitions. [2023-02-18 23:34:27,551 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1137 transitions. Word has length 180 [2023-02-18 23:34:27,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:34:27,551 INFO L495 AbstractCegarLoop]: Abstraction has 923 states and 1137 transitions. [2023-02-18 23:34:27,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.647058823529412) internal successors, (79), 16 states have internal predecessors, (79), 9 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2023-02-18 23:34:27,552 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1137 transitions. [2023-02-18 23:34:27,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-02-18 23:34:27,553 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:34:27,553 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 10, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:34:27,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2023-02-18 23:34:27,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:27,757 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:34:27,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:34:27,758 INFO L85 PathProgramCache]: Analyzing trace with hash -754709664, now seen corresponding path program 4 times [2023-02-18 23:34:27,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:34:27,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532036890] [2023-02-18 23:34:27,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:27,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:34:27,764 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:34:27,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [113574726] [2023-02-18 23:34:27,764 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-18 23:34:27,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:27,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:34:27,766 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:34:27,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2023-02-18 23:34:27,821 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-18 23:34:27,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:34:27,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-18 23:34:27,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:34:27,856 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 222 proven. 31 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2023-02-18 23:34:27,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:34:27,918 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 222 proven. 32 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2023-02-18 23:34:27,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:34:27,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532036890] [2023-02-18 23:34:27,919 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:34:27,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113574726] [2023-02-18 23:34:27,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113574726] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:34:27,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:34:27,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 17 [2023-02-18 23:34:27,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410201611] [2023-02-18 23:34:27,919 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:34:27,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-18 23:34:27,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:34:27,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-18 23:34:27,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2023-02-18 23:34:27,920 INFO L87 Difference]: Start difference. First operand 923 states and 1137 transitions. Second operand has 17 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 16 states have internal predecessors, (87), 10 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 6 states have call predecessors, (15), 8 states have call successors, (15) [2023-02-18 23:34:28,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:34:28,157 INFO L93 Difference]: Finished difference Result 1460 states and 1800 transitions. [2023-02-18 23:34:28,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-18 23:34:28,158 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 16 states have internal predecessors, (87), 10 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 6 states have call predecessors, (15), 8 states have call successors, (15) Word has length 177 [2023-02-18 23:34:28,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:34:28,161 INFO L225 Difference]: With dead ends: 1460 [2023-02-18 23:34:28,161 INFO L226 Difference]: Without dead ends: 867 [2023-02-18 23:34:28,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 329 SyntacticMatches, 12 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2023-02-18 23:34:28,163 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 114 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 23:34:28,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 656 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 23:34:28,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2023-02-18 23:34:28,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 849. [2023-02-18 23:34:28,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 672 states have (on average 1.1101190476190477) internal successors, (746), 674 states have internal predecessors, (746), 110 states have call successors, (110), 43 states have call predecessors, (110), 60 states have return successors, (180), 131 states have call predecessors, (180), 110 states have call successors, (180) [2023-02-18 23:34:28,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1036 transitions. [2023-02-18 23:34:28,200 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1036 transitions. Word has length 177 [2023-02-18 23:34:28,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:34:28,200 INFO L495 AbstractCegarLoop]: Abstraction has 849 states and 1036 transitions. [2023-02-18 23:34:28,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 16 states have internal predecessors, (87), 10 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 6 states have call predecessors, (15), 8 states have call successors, (15) [2023-02-18 23:34:28,200 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1036 transitions. [2023-02-18 23:34:28,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2023-02-18 23:34:28,201 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:34:28,202 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 12, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:34:28,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2023-02-18 23:34:28,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2023-02-18 23:34:28,407 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting binomialCoefficientErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:34:28,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:34:28,407 INFO L85 PathProgramCache]: Analyzing trace with hash -488351005, now seen corresponding path program 1 times [2023-02-18 23:34:28,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:34:28,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808575886] [2023-02-18 23:34:28,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:28,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:34:28,412 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:34:28,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [128974504] [2023-02-18 23:34:28,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:28,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:28,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:34:28,429 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:34:28,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2023-02-18 23:34:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:34:28,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-18 23:34:28,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:34:28,570 INFO L134 CoverageAnalysis]: Checked inductivity of 810 backedges. 157 proven. 11 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2023-02-18 23:34:28,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:34:28,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:34:28,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808575886] [2023-02-18 23:34:28,883 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:34:28,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128974504] [2023-02-18 23:34:28,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128974504] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 23:34:28,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 23:34:28,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2023-02-18 23:34:28,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278971729] [2023-02-18 23:34:28,883 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 23:34:28,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 23:34:28,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:34:28,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 23:34:28,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2023-02-18 23:34:28,884 INFO L87 Difference]: Start difference. First operand 849 states and 1036 transitions. Second operand has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 6 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2023-02-18 23:34:29,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:34:29,322 INFO L93 Difference]: Finished difference Result 908 states and 1102 transitions. [2023-02-18 23:34:29,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-18 23:34:29,323 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 6 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 198 [2023-02-18 23:34:29,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:34:29,325 INFO L225 Difference]: With dead ends: 908 [2023-02-18 23:34:29,325 INFO L226 Difference]: Without dead ends: 907 [2023-02-18 23:34:29,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2023-02-18 23:34:29,326 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 67 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 23:34:29,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 386 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 23:34:29,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2023-02-18 23:34:29,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 852. [2023-02-18 23:34:29,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 675 states have (on average 1.1096296296296295) internal successors, (749), 676 states have internal predecessors, (749), 110 states have call successors, (110), 43 states have call predecessors, (110), 60 states have return successors, (180), 132 states have call predecessors, (180), 110 states have call successors, (180) [2023-02-18 23:34:29,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1039 transitions. [2023-02-18 23:34:29,348 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1039 transitions. Word has length 198 [2023-02-18 23:34:29,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:34:29,349 INFO L495 AbstractCegarLoop]: Abstraction has 852 states and 1039 transitions. [2023-02-18 23:34:29,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 6 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2023-02-18 23:34:29,349 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1039 transitions. [2023-02-18 23:34:29,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2023-02-18 23:34:29,350 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:34:29,350 INFO L195 NwaCegarLoop]: trace histogram [22, 19, 11, 11, 11, 11, 11, 9, 9, 9, 8, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:34:29,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2023-02-18 23:34:29,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:29,555 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting factErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:34:29,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:34:29,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1269759871, now seen corresponding path program 5 times [2023-02-18 23:34:29,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:34:29,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171217116] [2023-02-18 23:34:29,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:29,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:34:29,561 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:34:29,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1610634229] [2023-02-18 23:34:29,561 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-18 23:34:29,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:29,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:34:29,562 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:34:29,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2023-02-18 23:34:29,650 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2023-02-18 23:34:29,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:34:29,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-18 23:34:29,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:34:29,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 451 proven. 63 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2023-02-18 23:34:29,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:34:29,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 451 proven. 69 refuted. 0 times theorem prover too weak. 644 trivial. 0 not checked. [2023-02-18 23:34:29,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:34:29,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171217116] [2023-02-18 23:34:29,932 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:34:29,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610634229] [2023-02-18 23:34:29,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610634229] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:34:29,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:34:29,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 31 [2023-02-18 23:34:29,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132994905] [2023-02-18 23:34:29,933 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:34:29,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-18 23:34:29,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:34:29,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-18 23:34:29,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2023-02-18 23:34:29,936 INFO L87 Difference]: Start difference. First operand 852 states and 1039 transitions. Second operand has 31 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 23 states have internal predecessors, (115), 17 states have call successors, (24), 9 states have call predecessors, (24), 4 states have return successors, (17), 9 states have call predecessors, (17), 11 states have call successors, (17) [2023-02-18 23:34:30,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:34:30,719 INFO L93 Difference]: Finished difference Result 1573 states and 1956 transitions. [2023-02-18 23:34:30,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-02-18 23:34:30,719 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 23 states have internal predecessors, (115), 17 states have call successors, (24), 9 states have call predecessors, (24), 4 states have return successors, (17), 9 states have call predecessors, (17), 11 states have call successors, (17) Word has length 225 [2023-02-18 23:34:30,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:34:30,743 INFO L225 Difference]: With dead ends: 1573 [2023-02-18 23:34:30,744 INFO L226 Difference]: Without dead ends: 977 [2023-02-18 23:34:30,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 417 SyntacticMatches, 6 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=525, Invalid=2781, Unknown=0, NotChecked=0, Total=3306 [2023-02-18 23:34:30,747 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 181 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 23:34:30,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 784 Invalid, 1511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 23:34:30,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2023-02-18 23:34:30,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 908. [2023-02-18 23:34:30,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 717 states have (on average 1.1059972105997211) internal successors, (793), 719 states have internal predecessors, (793), 118 states have call successors, (118), 48 states have call predecessors, (118), 66 states have return successors, (194), 140 states have call predecessors, (194), 118 states have call successors, (194) [2023-02-18 23:34:30,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1105 transitions. [2023-02-18 23:34:30,774 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1105 transitions. Word has length 225 [2023-02-18 23:34:30,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:34:30,774 INFO L495 AbstractCegarLoop]: Abstraction has 908 states and 1105 transitions. [2023-02-18 23:34:30,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 23 states have internal predecessors, (115), 17 states have call successors, (24), 9 states have call predecessors, (24), 4 states have return successors, (17), 9 states have call predecessors, (17), 11 states have call successors, (17) [2023-02-18 23:34:30,774 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1105 transitions. [2023-02-18 23:34:30,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2023-02-18 23:34:30,775 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:34:30,776 INFO L195 NwaCegarLoop]: trace histogram [22, 19, 12, 12, 12, 12, 10, 10, 10, 10, 9, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1] [2023-02-18 23:34:30,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2023-02-18 23:34:30,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:30,981 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting factErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:34:30,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:34:30,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1568610131, now seen corresponding path program 5 times [2023-02-18 23:34:30,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:34:30,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778032710] [2023-02-18 23:34:30,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:30,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:34:30,986 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:34:30,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1809790624] [2023-02-18 23:34:30,987 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-18 23:34:30,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:30,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:34:30,989 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:34:30,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2023-02-18 23:34:31,072 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2023-02-18 23:34:31,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:34:31,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-18 23:34:31,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:34:31,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1213 backedges. 452 proven. 162 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2023-02-18 23:34:31,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:34:31,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1213 backedges. 452 proven. 168 refuted. 0 times theorem prover too weak. 593 trivial. 0 not checked. [2023-02-18 23:34:31,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:34:31,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778032710] [2023-02-18 23:34:31,557 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:34:31,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809790624] [2023-02-18 23:34:31,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809790624] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:34:31,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:34:31,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 41 [2023-02-18 23:34:31,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852072934] [2023-02-18 23:34:31,558 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:34:31,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-18 23:34:31,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:34:31,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-18 23:34:31,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1488, Unknown=0, NotChecked=0, Total=1640 [2023-02-18 23:34:31,559 INFO L87 Difference]: Start difference. First operand 908 states and 1105 transitions. Second operand has 41 states, 39 states have (on average 3.5641025641025643) internal successors, (139), 34 states have internal predecessors, (139), 21 states have call successors, (29), 8 states have call predecessors, (29), 7 states have return successors, (23), 14 states have call predecessors, (23), 15 states have call successors, (23) [2023-02-18 23:34:34,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:34:34,306 INFO L93 Difference]: Finished difference Result 3275 states and 4869 transitions. [2023-02-18 23:34:34,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-02-18 23:34:34,307 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 3.5641025641025643) internal successors, (139), 34 states have internal predecessors, (139), 21 states have call successors, (29), 8 states have call predecessors, (29), 7 states have return successors, (23), 14 states have call predecessors, (23), 15 states have call successors, (23) Word has length 224 [2023-02-18 23:34:34,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:34:34,314 INFO L225 Difference]: With dead ends: 3275 [2023-02-18 23:34:34,314 INFO L226 Difference]: Without dead ends: 2487 [2023-02-18 23:34:34,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 413 SyntacticMatches, 14 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1563 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=762, Invalid=5718, Unknown=0, NotChecked=0, Total=6480 [2023-02-18 23:34:34,319 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 624 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 4831 mSolverCounterSat, 625 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 5456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 625 IncrementalHoareTripleChecker+Valid, 4831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:34:34,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 955 Invalid, 5456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [625 Valid, 4831 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-02-18 23:34:34,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2487 states. [2023-02-18 23:34:34,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2487 to 1387. [2023-02-18 23:34:34,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1387 states, 1087 states have (on average 1.1223551057957681) internal successors, (1220), 1100 states have internal predecessors, (1220), 200 states have call successors, (200), 65 states have call predecessors, (200), 93 states have return successors, (431), 221 states have call predecessors, (431), 200 states have call successors, (431) [2023-02-18 23:34:34,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1387 states and 1851 transitions. [2023-02-18 23:34:34,422 INFO L78 Accepts]: Start accepts. Automaton has 1387 states and 1851 transitions. Word has length 224 [2023-02-18 23:34:34,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:34:34,423 INFO L495 AbstractCegarLoop]: Abstraction has 1387 states and 1851 transitions. [2023-02-18 23:34:34,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 3.5641025641025643) internal successors, (139), 34 states have internal predecessors, (139), 21 states have call successors, (29), 8 states have call predecessors, (29), 7 states have return successors, (23), 14 states have call predecessors, (23), 15 states have call successors, (23) [2023-02-18 23:34:34,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 1851 transitions. [2023-02-18 23:34:34,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2023-02-18 23:34:34,424 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:34:34,424 INFO L195 NwaCegarLoop]: trace histogram [23, 20, 12, 11, 11, 11, 11, 9, 9, 9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:34:34,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2023-02-18 23:34:34,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2023-02-18 23:34:34,630 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting factErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:34:34,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:34:34,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1314023742, now seen corresponding path program 6 times [2023-02-18 23:34:34,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:34:34,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883708591] [2023-02-18 23:34:34,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:34,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:34:34,636 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:34:34,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1019503665] [2023-02-18 23:34:34,636 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-18 23:34:34,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:34,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:34:34,638 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:34:34,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2023-02-18 23:34:34,700 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-02-18 23:34:34,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:34:34,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 23:34:34,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:34:34,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1258 backedges. 593 proven. 0 refuted. 0 times theorem prover too weak. 665 trivial. 0 not checked. [2023-02-18 23:34:34,726 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 23:34:34,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:34:34,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883708591] [2023-02-18 23:34:34,726 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:34:34,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019503665] [2023-02-18 23:34:34,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019503665] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:34:34,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:34:34,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-18 23:34:34,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489403158] [2023-02-18 23:34:34,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:34:34,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 23:34:34,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:34:34,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 23:34:34,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-02-18 23:34:34,728 INFO L87 Difference]: Start difference. First operand 1387 states and 1851 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-02-18 23:34:34,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:34:34,915 INFO L93 Difference]: Finished difference Result 2361 states and 3201 transitions. [2023-02-18 23:34:34,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 23:34:34,916 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 233 [2023-02-18 23:34:34,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:34:34,919 INFO L225 Difference]: With dead ends: 2361 [2023-02-18 23:34:34,919 INFO L226 Difference]: Without dead ends: 1348 [2023-02-18 23:34:34,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-02-18 23:34:34,923 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 47 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:34:34,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 298 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:34:34,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2023-02-18 23:34:34,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 1345. [2023-02-18 23:34:34,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 1054 states have (on average 1.1233396584440227) internal successors, (1184), 1068 states have internal predecessors, (1184), 194 states have call successors, (194), 65 states have call predecessors, (194), 90 states have return successors, (394), 211 states have call predecessors, (394), 194 states have call successors, (394) [2023-02-18 23:34:34,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1772 transitions. [2023-02-18 23:34:34,967 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1772 transitions. Word has length 233 [2023-02-18 23:34:34,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:34:34,967 INFO L495 AbstractCegarLoop]: Abstraction has 1345 states and 1772 transitions. [2023-02-18 23:34:34,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-02-18 23:34:34,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1772 transitions. [2023-02-18 23:34:34,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2023-02-18 23:34:34,969 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:34:34,969 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 12, 10, 10, 10, 10, 10, 10, 10, 9, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:34:34,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2023-02-18 23:34:35,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2023-02-18 23:34:35,174 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting factErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:34:35,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:34:35,174 INFO L85 PathProgramCache]: Analyzing trace with hash 647330626, now seen corresponding path program 7 times [2023-02-18 23:34:35,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:34:35,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824744077] [2023-02-18 23:34:35,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:35,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:34:35,180 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:34:35,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [904336246] [2023-02-18 23:34:35,180 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-18 23:34:35,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:35,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:34:35,181 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:34:35,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2023-02-18 23:34:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:34:35,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-18 23:34:35,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:34:35,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 485 proven. 20 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2023-02-18 23:34:35,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:34:35,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 106 proven. 37 refuted. 0 times theorem prover too weak. 1108 trivial. 0 not checked. [2023-02-18 23:34:35,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:34:35,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824744077] [2023-02-18 23:34:35,364 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:34:35,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904336246] [2023-02-18 23:34:35,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904336246] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:34:35,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:34:35,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2023-02-18 23:34:35,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894464202] [2023-02-18 23:34:35,365 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:34:35,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-18 23:34:35,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:34:35,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-18 23:34:35,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2023-02-18 23:34:35,367 INFO L87 Difference]: Start difference. First operand 1345 states and 1772 transitions. Second operand has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 14 states have internal predecessors, (77), 9 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2023-02-18 23:34:35,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:34:35,726 INFO L93 Difference]: Finished difference Result 2326 states and 3105 transitions. [2023-02-18 23:34:35,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-18 23:34:35,726 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 14 states have internal predecessors, (77), 9 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 233 [2023-02-18 23:34:35,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:34:35,729 INFO L225 Difference]: With dead ends: 2326 [2023-02-18 23:34:35,729 INFO L226 Difference]: Without dead ends: 1293 [2023-02-18 23:34:35,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 446 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2023-02-18 23:34:35,733 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 87 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 23:34:35,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 734 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 23:34:35,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2023-02-18 23:34:35,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1286. [2023-02-18 23:34:35,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 1007 states have (on average 1.1221449851042702) internal successors, (1130), 1018 states have internal predecessors, (1130), 184 states have call successors, (184), 65 states have call predecessors, (184), 88 states have return successors, (360), 202 states have call predecessors, (360), 184 states have call successors, (360) [2023-02-18 23:34:35,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1674 transitions. [2023-02-18 23:34:35,801 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1674 transitions. Word has length 233 [2023-02-18 23:34:35,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:34:35,802 INFO L495 AbstractCegarLoop]: Abstraction has 1286 states and 1674 transitions. [2023-02-18 23:34:35,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 14 states have internal predecessors, (77), 9 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2023-02-18 23:34:35,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1674 transitions. [2023-02-18 23:34:35,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2023-02-18 23:34:35,803 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:34:35,803 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 13, 9, 9, 8, 8, 8, 8, 8, 8, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:34:35,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2023-02-18 23:34:36,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2023-02-18 23:34:36,009 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:34:36,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:34:36,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1803695718, now seen corresponding path program 5 times [2023-02-18 23:34:36,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:34:36,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860870397] [2023-02-18 23:34:36,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:36,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:34:36,017 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:34:36,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1258818435] [2023-02-18 23:34:36,017 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-18 23:34:36,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:36,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:34:36,019 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:34:36,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2023-02-18 23:34:36,111 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2023-02-18 23:34:36,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:34:36,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-18 23:34:36,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:34:36,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1223 backedges. 367 proven. 36 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2023-02-18 23:34:36,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:34:36,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1223 backedges. 89 proven. 36 refuted. 0 times theorem prover too weak. 1098 trivial. 0 not checked. [2023-02-18 23:34:36,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:34:36,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860870397] [2023-02-18 23:34:36,217 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:34:36,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258818435] [2023-02-18 23:34:36,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258818435] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:34:36,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:34:36,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2023-02-18 23:34:36,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798588803] [2023-02-18 23:34:36,217 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:34:36,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-18 23:34:36,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:34:36,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-18 23:34:36,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2023-02-18 23:34:36,219 INFO L87 Difference]: Start difference. First operand 1286 states and 1674 transitions. Second operand has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 18 states have internal predecessors, (82), 8 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2023-02-18 23:34:36,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:34:36,372 INFO L93 Difference]: Finished difference Result 2287 states and 3008 transitions. [2023-02-18 23:34:36,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-18 23:34:36,372 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 18 states have internal predecessors, (82), 8 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) Word has length 241 [2023-02-18 23:34:36,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:34:36,375 INFO L225 Difference]: With dead ends: 2287 [2023-02-18 23:34:36,375 INFO L226 Difference]: Without dead ends: 1306 [2023-02-18 23:34:36,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 458 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2023-02-18 23:34:36,378 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 54 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:34:36,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 510 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:34:36,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2023-02-18 23:34:36,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1286. [2023-02-18 23:34:36,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 1007 states have (on average 1.1211519364448859) internal successors, (1129), 1018 states have internal predecessors, (1129), 184 states have call successors, (184), 65 states have call predecessors, (184), 88 states have return successors, (360), 202 states have call predecessors, (360), 184 states have call successors, (360) [2023-02-18 23:34:36,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1673 transitions. [2023-02-18 23:34:36,419 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1673 transitions. Word has length 241 [2023-02-18 23:34:36,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:34:36,420 INFO L495 AbstractCegarLoop]: Abstraction has 1286 states and 1673 transitions. [2023-02-18 23:34:36,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 18 states have internal predecessors, (82), 8 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2023-02-18 23:34:36,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1673 transitions. [2023-02-18 23:34:36,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-02-18 23:34:36,421 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:34:36,421 INFO L195 NwaCegarLoop]: trace histogram [25, 24, 13, 13, 13, 13, 13, 13, 13, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:34:36,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2023-02-18 23:34:36,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2023-02-18 23:34:36,627 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting factErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:34:36,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:34:36,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1357546713, now seen corresponding path program 6 times [2023-02-18 23:34:36,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:34:36,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453562795] [2023-02-18 23:34:36,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:36,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:34:36,633 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:34:36,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [793418743] [2023-02-18 23:34:36,633 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-18 23:34:36,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:36,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:34:36,634 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:34:36,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2023-02-18 23:34:36,713 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2023-02-18 23:34:36,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:34:36,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-18 23:34:36,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:34:36,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1714 backedges. 445 proven. 37 refuted. 0 times theorem prover too weak. 1232 trivial. 0 not checked. [2023-02-18 23:34:36,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:34:37,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:34:37,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453562795] [2023-02-18 23:34:37,160 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:34:37,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793418743] [2023-02-18 23:34:37,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793418743] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 23:34:37,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 23:34:37,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2023-02-18 23:34:37,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172216813] [2023-02-18 23:34:37,160 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 23:34:37,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-18 23:34:37,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:34:37,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-18 23:34:37,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2023-02-18 23:34:37,161 INFO L87 Difference]: Start difference. First operand 1286 states and 1673 transitions. Second operand has 15 states, 13 states have (on average 4.461538461538462) internal successors, (58), 15 states have internal predecessors, (58), 3 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2023-02-18 23:34:37,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:34:37,848 INFO L93 Difference]: Finished difference Result 1370 states and 1829 transitions. [2023-02-18 23:34:37,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 23:34:37,848 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.461538461538462) internal successors, (58), 15 states have internal predecessors, (58), 3 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 258 [2023-02-18 23:34:37,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:34:37,851 INFO L225 Difference]: With dead ends: 1370 [2023-02-18 23:34:37,852 INFO L226 Difference]: Without dead ends: 1369 [2023-02-18 23:34:37,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2023-02-18 23:34:37,852 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 48 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 23:34:37,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 400 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 23:34:37,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2023-02-18 23:34:37,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1297. [2023-02-18 23:34:37,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1297 states, 1017 states have (on average 1.1170108161258603) internal successors, (1136), 1026 states have internal predecessors, (1136), 184 states have call successors, (184), 65 states have call predecessors, (184), 89 states have return successors, (365), 205 states have call predecessors, (365), 184 states have call successors, (365) [2023-02-18 23:34:37,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1297 states and 1685 transitions. [2023-02-18 23:34:37,897 INFO L78 Accepts]: Start accepts. Automaton has 1297 states and 1685 transitions. Word has length 258 [2023-02-18 23:34:37,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:34:37,897 INFO L495 AbstractCegarLoop]: Abstraction has 1297 states and 1685 transitions. [2023-02-18 23:34:37,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.461538461538462) internal successors, (58), 15 states have internal predecessors, (58), 3 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2023-02-18 23:34:37,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 1685 transitions. [2023-02-18 23:34:37,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2023-02-18 23:34:37,898 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:34:37,899 INFO L195 NwaCegarLoop]: trace histogram [28, 25, 16, 16, 16, 16, 14, 14, 14, 13, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:34:37,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2023-02-18 23:34:38,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:38,103 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting factErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:34:38,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:34:38,104 INFO L85 PathProgramCache]: Analyzing trace with hash -2041674535, now seen corresponding path program 7 times [2023-02-18 23:34:38,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:34:38,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173430803] [2023-02-18 23:34:38,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:38,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:34:38,111 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:34:38,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [387269501] [2023-02-18 23:34:38,112 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-18 23:34:38,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:38,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:34:38,113 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:34:38,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2023-02-18 23:34:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:34:38,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-18 23:34:38,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:34:38,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2083 backedges. 410 proven. 104 refuted. 0 times theorem prover too weak. 1569 trivial. 0 not checked. [2023-02-18 23:34:38,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:34:38,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2083 backedges. 410 proven. 104 refuted. 0 times theorem prover too weak. 1569 trivial. 0 not checked. [2023-02-18 23:34:38,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:34:38,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173430803] [2023-02-18 23:34:38,460 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:34:38,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387269501] [2023-02-18 23:34:38,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387269501] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:34:38,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:34:38,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 30 [2023-02-18 23:34:38,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956132594] [2023-02-18 23:34:38,461 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:34:38,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-18 23:34:38,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:34:38,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-18 23:34:38,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2023-02-18 23:34:38,462 INFO L87 Difference]: Start difference. First operand 1297 states and 1685 transitions. Second operand has 30 states, 30 states have (on average 3.3666666666666667) internal successors, (101), 25 states have internal predecessors, (101), 15 states have call successors, (22), 6 states have call predecessors, (22), 2 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16) [2023-02-18 23:34:39,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:34:39,180 INFO L93 Difference]: Finished difference Result 2810 states and 3672 transitions. [2023-02-18 23:34:39,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-02-18 23:34:39,181 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.3666666666666667) internal successors, (101), 25 states have internal predecessors, (101), 15 states have call successors, (22), 6 states have call predecessors, (22), 2 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16) Word has length 278 [2023-02-18 23:34:39,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:34:39,185 INFO L225 Difference]: With dead ends: 2810 [2023-02-18 23:34:39,185 INFO L226 Difference]: Without dead ends: 1650 [2023-02-18 23:34:39,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 519 SyntacticMatches, 9 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=337, Invalid=2213, Unknown=0, NotChecked=0, Total=2550 [2023-02-18 23:34:39,190 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 184 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 23:34:39,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 644 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 23:34:39,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2023-02-18 23:34:39,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1588. [2023-02-18 23:34:39,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1588 states, 1257 states have (on average 1.1177406523468576) internal successors, (1405), 1261 states have internal predecessors, (1405), 217 states have call successors, (217), 79 states have call predecessors, (217), 107 states have return successors, (397), 247 states have call predecessors, (397), 217 states have call successors, (397) [2023-02-18 23:34:39,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2019 transitions. [2023-02-18 23:34:39,259 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2019 transitions. Word has length 278 [2023-02-18 23:34:39,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:34:39,259 INFO L495 AbstractCegarLoop]: Abstraction has 1588 states and 2019 transitions. [2023-02-18 23:34:39,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.3666666666666667) internal successors, (101), 25 states have internal predecessors, (101), 15 states have call successors, (22), 6 states have call predecessors, (22), 2 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16) [2023-02-18 23:34:39,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2019 transitions. [2023-02-18 23:34:39,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2023-02-18 23:34:39,261 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:34:39,261 INFO L195 NwaCegarLoop]: trace histogram [28, 27, 15, 15, 15, 15, 15, 15, 15, 14, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:34:39,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2023-02-18 23:34:39,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:39,466 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting factErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:34:39,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:34:39,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1582863239, now seen corresponding path program 8 times [2023-02-18 23:34:39,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:34:39,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956732533] [2023-02-18 23:34:39,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:39,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:34:39,474 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:34:39,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [218789740] [2023-02-18 23:34:39,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 23:34:39,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:39,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:34:39,475 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:34:39,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2023-02-18 23:34:39,594 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 23:34:39,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:34:39,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-18 23:34:39,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:34:39,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 1088 proven. 69 refuted. 0 times theorem prover too weak. 1076 trivial. 0 not checked. [2023-02-18 23:34:39,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:34:39,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 420 proven. 190 refuted. 0 times theorem prover too weak. 1623 trivial. 0 not checked. [2023-02-18 23:34:39,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:34:39,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956732533] [2023-02-18 23:34:39,789 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:34:39,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218789740] [2023-02-18 23:34:39,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218789740] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:34:39,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:34:39,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 19 [2023-02-18 23:34:39,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712800254] [2023-02-18 23:34:39,791 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:34:39,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-18 23:34:39,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:34:39,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-18 23:34:39,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2023-02-18 23:34:39,792 INFO L87 Difference]: Start difference. First operand 1588 states and 2019 transitions. Second operand has 19 states, 17 states have (on average 5.764705882352941) internal successors, (98), 19 states have internal predecessors, (98), 12 states have call successors, (19), 2 states have call predecessors, (19), 6 states have return successors, (18), 8 states have call predecessors, (18), 12 states have call successors, (18) [2023-02-18 23:34:40,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:34:40,155 INFO L93 Difference]: Finished difference Result 3297 states and 4387 transitions. [2023-02-18 23:34:40,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-18 23:34:40,155 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.764705882352941) internal successors, (98), 19 states have internal predecessors, (98), 12 states have call successors, (19), 2 states have call predecessors, (19), 6 states have return successors, (18), 8 states have call predecessors, (18), 12 states have call successors, (18) Word has length 298 [2023-02-18 23:34:40,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:34:40,174 INFO L225 Difference]: With dead ends: 3297 [2023-02-18 23:34:40,184 INFO L226 Difference]: Without dead ends: 1803 [2023-02-18 23:34:40,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 563 SyntacticMatches, 15 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2023-02-18 23:34:40,189 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 108 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 23:34:40,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 324 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 23:34:40,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2023-02-18 23:34:40,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1569. [2023-02-18 23:34:40,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 1242 states have (on average 1.1231884057971016) internal successors, (1395), 1245 states have internal predecessors, (1395), 216 states have call successors, (216), 77 states have call predecessors, (216), 104 states have return successors, (401), 246 states have call predecessors, (401), 215 states have call successors, (401) [2023-02-18 23:34:40,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2012 transitions. [2023-02-18 23:34:40,254 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2012 transitions. Word has length 298 [2023-02-18 23:34:40,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:34:40,254 INFO L495 AbstractCegarLoop]: Abstraction has 1569 states and 2012 transitions. [2023-02-18 23:34:40,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.764705882352941) internal successors, (98), 19 states have internal predecessors, (98), 12 states have call successors, (19), 2 states have call predecessors, (19), 6 states have return successors, (18), 8 states have call predecessors, (18), 12 states have call successors, (18) [2023-02-18 23:34:40,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2012 transitions. [2023-02-18 23:34:40,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2023-02-18 23:34:40,257 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:34:40,257 INFO L195 NwaCegarLoop]: trace histogram [29, 28, 16, 16, 16, 16, 16, 16, 16, 15, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:34:40,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2023-02-18 23:34:40,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:40,461 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting factErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:34:40,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:34:40,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1885906521, now seen corresponding path program 9 times [2023-02-18 23:34:40,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:34:40,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757205064] [2023-02-18 23:34:40,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:34:40,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:34:40,468 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:34:40,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [964358647] [2023-02-18 23:34:40,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 23:34:40,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:34:40,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:34:40,470 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:34:40,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2023-02-18 23:34:40,580 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-02-18 23:34:40,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:34:40,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-18 23:34:40,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:34:48,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2433 backedges. 686 proven. 128 refuted. 0 times theorem prover too weak. 1619 trivial. 0 not checked. [2023-02-18 23:34:48,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:34:49,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:34:49,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757205064] [2023-02-18 23:34:49,131 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:34:49,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964358647] [2023-02-18 23:34:49,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964358647] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 23:34:49,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 23:34:49,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2023-02-18 23:34:49,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398067364] [2023-02-18 23:34:49,132 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 23:34:49,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-18 23:34:49,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:34:49,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-18 23:34:49,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=857, Unknown=6, NotChecked=0, Total=992 [2023-02-18 23:34:49,133 INFO L87 Difference]: Start difference. First operand 1569 states and 2012 transitions. Second operand has 30 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 10 states have call successors, (13), 3 states have call predecessors, (13), 6 states have return successors, (13), 10 states have call predecessors, (13), 8 states have call successors, (13) [2023-02-18 23:34:51,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:34:53,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:34:56,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:34:58,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:35:00,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:35:02,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:35:04,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:35:06,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:35:08,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:35:11,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:35:15,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:35:18,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:35:20,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:35:22,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:35:25,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:35:26,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:35:28,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:35:30,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:35:31,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:35:33,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:35:34,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:35:38,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:35:39,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:35:42,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:35:43,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:35:45,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:35:46,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:35:50,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:35:51,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:35:53,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:35:55,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:35:58,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:35:59,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:36:03,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:36:05,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:36:06,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:36:08,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:36:12,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:36:14,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:36:17,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:36:18,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:36:20,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:36:22,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:36:25,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:36:27,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:36:30,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:36:31,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:36:33,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:36:35,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:36:35,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:36:35,742 INFO L93 Difference]: Finished difference Result 2224 states and 3145 transitions. [2023-02-18 23:36:35,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-18 23:36:35,742 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 10 states have call successors, (13), 3 states have call predecessors, (13), 6 states have return successors, (13), 10 states have call predecessors, (13), 8 states have call successors, (13) Word has length 308 [2023-02-18 23:36:35,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:36:35,747 INFO L225 Difference]: With dead ends: 2224 [2023-02-18 23:36:35,747 INFO L226 Difference]: Without dead ends: 2223 [2023-02-18 23:36:35,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=352, Invalid=1992, Unknown=8, NotChecked=0, Total=2352 [2023-02-18 23:36:35,748 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 150 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 75 mSolverCounterUnsat, 76 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 98.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 76 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 98.8s IncrementalHoareTripleChecker+Time [2023-02-18 23:36:35,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 894 Invalid, 1300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1149 Invalid, 76 Unknown, 0 Unchecked, 98.8s Time] [2023-02-18 23:36:35,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2223 states. [2023-02-18 23:36:35,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2223 to 1768. [2023-02-18 23:36:35,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1768 states, 1399 states have (on average 1.128663330950679) internal successors, (1579), 1402 states have internal predecessors, (1579), 249 states have call successors, (249), 84 states have call predecessors, (249), 113 states have return successors, (464), 281 states have call predecessors, (464), 248 states have call successors, (464) [2023-02-18 23:36:35,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1768 states to 1768 states and 2292 transitions. [2023-02-18 23:36:35,810 INFO L78 Accepts]: Start accepts. Automaton has 1768 states and 2292 transitions. Word has length 308 [2023-02-18 23:36:35,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:36:35,811 INFO L495 AbstractCegarLoop]: Abstraction has 1768 states and 2292 transitions. [2023-02-18 23:36:35,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 10 states have call successors, (13), 3 states have call predecessors, (13), 6 states have return successors, (13), 10 states have call predecessors, (13), 8 states have call successors, (13) [2023-02-18 23:36:35,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1768 states and 2292 transitions. [2023-02-18 23:36:35,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2023-02-18 23:36:35,812 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:36:35,812 INFO L195 NwaCegarLoop]: trace histogram [29, 28, 16, 13, 13, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:36:35,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2023-02-18 23:36:36,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:36:36,018 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:36:36,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:36:36,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1558776128, now seen corresponding path program 6 times [2023-02-18 23:36:36,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:36:36,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341964340] [2023-02-18 23:36:36,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:36:36,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:36:36,025 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:36:36,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1090914557] [2023-02-18 23:36:36,025 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-18 23:36:36,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:36:36,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:36:36,027 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:36:36,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2023-02-18 23:36:36,096 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-02-18 23:36:36,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:36:36,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 23:36:36,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:36:36,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 100 proven. 46 refuted. 0 times theorem prover too weak. 2089 trivial. 0 not checked. [2023-02-18 23:36:36,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:36:36,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 100 proven. 46 refuted. 0 times theorem prover too weak. 2089 trivial. 0 not checked. [2023-02-18 23:36:36,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:36:36,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341964340] [2023-02-18 23:36:36,179 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:36:36,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090914557] [2023-02-18 23:36:36,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090914557] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:36:36,179 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:36:36,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-02-18 23:36:36,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432689598] [2023-02-18 23:36:36,180 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:36:36,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 23:36:36,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:36:36,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 23:36:36,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2023-02-18 23:36:36,181 INFO L87 Difference]: Start difference. First operand 1768 states and 2292 transitions. Second operand has 16 states, 15 states have (on average 5.266666666666667) internal successors, (79), 12 states have internal predecessors, (79), 7 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2023-02-18 23:36:36,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:36:36,505 INFO L93 Difference]: Finished difference Result 2116 states and 2825 transitions. [2023-02-18 23:36:36,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-18 23:36:36,506 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.266666666666667) internal successors, (79), 12 states have internal predecessors, (79), 7 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) Word has length 315 [2023-02-18 23:36:36,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:36:36,510 INFO L225 Difference]: With dead ends: 2116 [2023-02-18 23:36:36,510 INFO L226 Difference]: Without dead ends: 2115 [2023-02-18 23:36:36,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 618 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2023-02-18 23:36:36,511 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 101 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 23:36:36,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 608 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 23:36:36,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2115 states. [2023-02-18 23:36:36,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2115 to 2082. [2023-02-18 23:36:36,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2082 states, 1642 states have (on average 1.135809987819732) internal successors, (1865), 1632 states have internal predecessors, (1865), 302 states have call successors, (302), 98 states have call predecessors, (302), 132 states have return successors, (582), 351 states have call predecessors, (582), 301 states have call successors, (582) [2023-02-18 23:36:36,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 2749 transitions. [2023-02-18 23:36:36,598 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 2749 transitions. Word has length 315 [2023-02-18 23:36:36,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:36:36,598 INFO L495 AbstractCegarLoop]: Abstraction has 2082 states and 2749 transitions. [2023-02-18 23:36:36,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.266666666666667) internal successors, (79), 12 states have internal predecessors, (79), 7 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2023-02-18 23:36:36,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 2749 transitions. [2023-02-18 23:36:36,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2023-02-18 23:36:36,600 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:36:36,600 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 17, 12, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:36:36,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2023-02-18 23:36:36,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:36:36,804 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting binomialCoefficientErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:36:36,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:36:36,805 INFO L85 PathProgramCache]: Analyzing trace with hash 959159986, now seen corresponding path program 1 times [2023-02-18 23:36:36,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:36:36,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154270913] [2023-02-18 23:36:36,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:36:36,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:36:36,813 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:36:36,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1440416168] [2023-02-18 23:36:36,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:36:36,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:36:36,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:36:36,815 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:36:36,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2023-02-18 23:36:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:36:36,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 23:36:36,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:36:36,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2277 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 2117 trivial. 0 not checked. [2023-02-18 23:36:36,956 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 23:36:36,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:36:36,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154270913] [2023-02-18 23:36:36,956 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:36:36,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440416168] [2023-02-18 23:36:36,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440416168] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:36:36,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:36:36,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-18 23:36:36,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594482599] [2023-02-18 23:36:36,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:36:36,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 23:36:36,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:36:36,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 23:36:36,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-02-18 23:36:36,957 INFO L87 Difference]: Start difference. First operand 2082 states and 2749 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-18 23:36:37,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:36:37,116 INFO L93 Difference]: Finished difference Result 3412 states and 4631 transitions. [2023-02-18 23:36:37,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 23:36:37,117 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 317 [2023-02-18 23:36:37,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:36:37,121 INFO L225 Difference]: With dead ends: 3412 [2023-02-18 23:36:37,121 INFO L226 Difference]: Without dead ends: 1903 [2023-02-18 23:36:37,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-02-18 23:36:37,127 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 47 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:36:37,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 309 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:36:37,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2023-02-18 23:36:37,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1897. [2023-02-18 23:36:37,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1485 states have (on average 1.127946127946128) internal successors, (1675), 1499 states have internal predecessors, (1675), 276 states have call successors, (276), 98 states have call predecessors, (276), 130 states have return successors, (522), 299 states have call predecessors, (522), 276 states have call successors, (522) [2023-02-18 23:36:37,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 2473 transitions. [2023-02-18 23:36:37,188 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 2473 transitions. Word has length 317 [2023-02-18 23:36:37,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:36:37,188 INFO L495 AbstractCegarLoop]: Abstraction has 1897 states and 2473 transitions. [2023-02-18 23:36:37,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-18 23:36:37,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2473 transitions. [2023-02-18 23:36:37,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2023-02-18 23:36:37,190 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:36:37,190 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 18, 12, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:36:37,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2023-02-18 23:36:37,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2023-02-18 23:36:37,409 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting binomialCoefficientErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:36:37,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:36:37,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1873406755, now seen corresponding path program 2 times [2023-02-18 23:36:37,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:36:37,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835965014] [2023-02-18 23:36:37,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:36:37,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:36:37,416 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:36:37,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1730403557] [2023-02-18 23:36:37,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 23:36:37,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:36:37,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:36:37,418 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:36:37,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2023-02-18 23:36:37,519 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 23:36:37,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:36:37,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-18 23:36:37,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:36:37,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2419 backedges. 689 proven. 44 refuted. 0 times theorem prover too weak. 1686 trivial. 0 not checked. [2023-02-18 23:36:37,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:36:37,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2419 backedges. 69 proven. 44 refuted. 0 times theorem prover too weak. 2306 trivial. 0 not checked. [2023-02-18 23:36:37,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:36:37,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835965014] [2023-02-18 23:36:37,598 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:36:37,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730403557] [2023-02-18 23:36:37,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730403557] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:36:37,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:36:37,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2023-02-18 23:36:37,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228079481] [2023-02-18 23:36:37,598 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:36:37,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-18 23:36:37,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:36:37,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-18 23:36:37,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-02-18 23:36:37,599 INFO L87 Difference]: Start difference. First operand 1897 states and 2473 transitions. Second operand has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 7 states have call predecessors, (17), 7 states have call successors, (17) [2023-02-18 23:36:37,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:36:37,822 INFO L93 Difference]: Finished difference Result 3070 states and 4037 transitions. [2023-02-18 23:36:37,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-18 23:36:37,823 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 7 states have call predecessors, (17), 7 states have call successors, (17) Word has length 326 [2023-02-18 23:36:37,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:36:37,826 INFO L225 Difference]: With dead ends: 3070 [2023-02-18 23:36:37,826 INFO L226 Difference]: Without dead ends: 1622 [2023-02-18 23:36:37,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 661 GetRequests, 634 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=189, Invalid=461, Unknown=0, NotChecked=0, Total=650 [2023-02-18 23:36:37,831 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 73 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:36:37,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 318 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:36:37,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2023-02-18 23:36:37,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1618. [2023-02-18 23:36:37,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1618 states, 1268 states have (on average 1.1206624605678233) internal successors, (1421), 1278 states have internal predecessors, (1421), 224 states have call successors, (224), 89 states have call predecessors, (224), 120 states have return successors, (442), 250 states have call predecessors, (442), 224 states have call successors, (442) [2023-02-18 23:36:37,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2087 transitions. [2023-02-18 23:36:37,886 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2087 transitions. Word has length 326 [2023-02-18 23:36:37,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:36:37,886 INFO L495 AbstractCegarLoop]: Abstraction has 1618 states and 2087 transitions. [2023-02-18 23:36:37,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 7 states have call predecessors, (17), 7 states have call successors, (17) [2023-02-18 23:36:37,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2087 transitions. [2023-02-18 23:36:37,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2023-02-18 23:36:37,888 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:36:37,888 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 17, 13, 13, 13, 13, 13, 13, 13, 13, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:36:37,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2023-02-18 23:36:38,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2023-02-18 23:36:38,093 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting binomialCoefficientErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:36:38,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:36:38,094 INFO L85 PathProgramCache]: Analyzing trace with hash 242893842, now seen corresponding path program 2 times [2023-02-18 23:36:38,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:36:38,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919622915] [2023-02-18 23:36:38,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:36:38,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:36:38,103 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:36:38,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1102708528] [2023-02-18 23:36:38,103 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 23:36:38,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:36:38,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:36:38,112 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:36:38,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2023-02-18 23:36:38,165 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-18 23:36:38,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:36:38,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-18 23:36:38,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:36:38,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2465 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 2433 trivial. 0 not checked. [2023-02-18 23:36:38,178 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 23:36:38,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:36:38,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919622915] [2023-02-18 23:36:38,178 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:36:38,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102708528] [2023-02-18 23:36:38,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102708528] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:36:38,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:36:38,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 23:36:38,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638006060] [2023-02-18 23:36:38,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:36:38,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 23:36:38,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:36:38,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 23:36:38,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 23:36:38,180 INFO L87 Difference]: Start difference. First operand 1618 states and 2087 transitions. Second operand has 5 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-18 23:36:38,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:36:38,248 INFO L93 Difference]: Finished difference Result 1620 states and 2087 transitions. [2023-02-18 23:36:38,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 23:36:38,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 327 [2023-02-18 23:36:38,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:36:38,251 INFO L225 Difference]: With dead ends: 1620 [2023-02-18 23:36:38,251 INFO L226 Difference]: Without dead ends: 1619 [2023-02-18 23:36:38,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 23:36:38,252 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 27 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 23:36:38,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 215 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 23:36:38,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2023-02-18 23:36:38,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1617. [2023-02-18 23:36:38,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1268 states have (on average 1.1041009463722398) internal successors, (1400), 1277 states have internal predecessors, (1400), 224 states have call successors, (224), 89 states have call predecessors, (224), 120 states have return successors, (442), 250 states have call predecessors, (442), 224 states have call successors, (442) [2023-02-18 23:36:38,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2066 transitions. [2023-02-18 23:36:38,301 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2066 transitions. Word has length 327 [2023-02-18 23:36:38,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:36:38,302 INFO L495 AbstractCegarLoop]: Abstraction has 1617 states and 2066 transitions. [2023-02-18 23:36:38,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-18 23:36:38,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2066 transitions. [2023-02-18 23:36:38,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2023-02-18 23:36:38,303 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:36:38,303 INFO L195 NwaCegarLoop]: trace histogram [31, 31, 18, 13, 13, 13, 13, 13, 13, 13, 13, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:36:38,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2023-02-18 23:36:38,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2023-02-18 23:36:38,507 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting binomialCoefficientErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:36:38,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:36:38,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1457793093, now seen corresponding path program 3 times [2023-02-18 23:36:38,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:36:38,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388290227] [2023-02-18 23:36:38,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:36:38,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:36:38,515 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:36:38,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2050944977] [2023-02-18 23:36:38,515 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 23:36:38,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:36:38,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:36:38,516 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:36:38,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2023-02-18 23:36:38,587 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-02-18 23:36:38,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:36:38,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 23:36:38,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:36:38,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2610 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 2463 trivial. 0 not checked. [2023-02-18 23:36:38,626 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 23:36:38,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:36:38,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388290227] [2023-02-18 23:36:38,627 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:36:38,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050944977] [2023-02-18 23:36:38,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050944977] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:36:38,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:36:38,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 23:36:38,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231459673] [2023-02-18 23:36:38,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:36:38,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 23:36:38,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:36:38,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 23:36:38,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-18 23:36:38,629 INFO L87 Difference]: Start difference. First operand 1617 states and 2066 transitions. Second operand has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-02-18 23:36:38,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:36:38,755 INFO L93 Difference]: Finished difference Result 2831 states and 3711 transitions. [2023-02-18 23:36:38,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 23:36:38,755 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 336 [2023-02-18 23:36:38,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:36:38,759 INFO L225 Difference]: With dead ends: 2831 [2023-02-18 23:36:38,759 INFO L226 Difference]: Without dead ends: 1621 [2023-02-18 23:36:38,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-18 23:36:38,761 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 35 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:36:38,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 250 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:36:38,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2023-02-18 23:36:38,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1617. [2023-02-18 23:36:38,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1268 states have (on average 1.1033123028391167) internal successors, (1399), 1277 states have internal predecessors, (1399), 224 states have call successors, (224), 89 states have call predecessors, (224), 120 states have return successors, (437), 250 states have call predecessors, (437), 224 states have call successors, (437) [2023-02-18 23:36:38,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2060 transitions. [2023-02-18 23:36:38,814 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2060 transitions. Word has length 336 [2023-02-18 23:36:38,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:36:38,814 INFO L495 AbstractCegarLoop]: Abstraction has 1617 states and 2060 transitions. [2023-02-18 23:36:38,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-02-18 23:36:38,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2060 transitions. [2023-02-18 23:36:38,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2023-02-18 23:36:38,816 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:36:38,816 INFO L195 NwaCegarLoop]: trace histogram [36, 33, 21, 21, 21, 21, 19, 19, 19, 18, 15, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:36:38,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2023-02-18 23:36:39,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:36:39,021 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting factErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:36:39,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:36:39,022 INFO L85 PathProgramCache]: Analyzing trace with hash -326900065, now seen corresponding path program 10 times [2023-02-18 23:36:39,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:36:39,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862632566] [2023-02-18 23:36:39,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:36:39,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:36:39,029 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:36:39,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1640602306] [2023-02-18 23:36:39,029 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-18 23:36:39,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:36:39,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:36:39,031 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:36:39,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2023-02-18 23:36:39,121 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-18 23:36:39,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:36:39,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-18 23:36:39,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:36:39,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3628 backedges. 2211 proven. 193 refuted. 0 times theorem prover too weak. 1224 trivial. 0 not checked. [2023-02-18 23:36:39,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:36:39,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3628 backedges. 907 proven. 693 refuted. 0 times theorem prover too weak. 2028 trivial. 0 not checked. [2023-02-18 23:36:39,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:36:39,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862632566] [2023-02-18 23:36:39,423 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:36:39,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640602306] [2023-02-18 23:36:39,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640602306] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:36:39,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:36:39,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 25 [2023-02-18 23:36:39,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299965013] [2023-02-18 23:36:39,424 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:36:39,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-18 23:36:39,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:36:39,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-18 23:36:39,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2023-02-18 23:36:39,425 INFO L87 Difference]: Start difference. First operand 1617 states and 2060 transitions. Second operand has 25 states, 21 states have (on average 6.476190476190476) internal successors, (136), 25 states have internal predecessors, (136), 17 states have call successors, (31), 2 states have call predecessors, (31), 10 states have return successors, (32), 12 states have call predecessors, (32), 17 states have call successors, (32) [2023-02-18 23:36:40,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:36:40,229 INFO L93 Difference]: Finished difference Result 3510 states and 4731 transitions. [2023-02-18 23:36:40,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-18 23:36:40,229 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 6.476190476190476) internal successors, (136), 25 states have internal predecessors, (136), 17 states have call successors, (31), 2 states have call predecessors, (31), 10 states have return successors, (32), 12 states have call predecessors, (32), 17 states have call successors, (32) Word has length 362 [2023-02-18 23:36:40,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:36:40,235 INFO L225 Difference]: With dead ends: 3510 [2023-02-18 23:36:40,235 INFO L226 Difference]: Without dead ends: 2070 [2023-02-18 23:36:40,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 742 GetRequests, 685 SyntacticMatches, 19 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=260, Invalid=1300, Unknown=0, NotChecked=0, Total=1560 [2023-02-18 23:36:40,238 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 138 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 1439 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 1596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-18 23:36:40,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1002 Invalid, 1596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1439 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-18 23:36:40,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2070 states. [2023-02-18 23:36:40,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2070 to 1896. [2023-02-18 23:36:40,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1896 states, 1491 states have (on average 1.1167002012072436) internal successors, (1665), 1501 states have internal predecessors, (1665), 267 states have call successors, (267), 92 states have call predecessors, (267), 133 states have return successors, (611), 302 states have call predecessors, (611), 261 states have call successors, (611) [2023-02-18 23:36:40,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2543 transitions. [2023-02-18 23:36:40,307 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2543 transitions. Word has length 362 [2023-02-18 23:36:40,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:36:40,308 INFO L495 AbstractCegarLoop]: Abstraction has 1896 states and 2543 transitions. [2023-02-18 23:36:40,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 6.476190476190476) internal successors, (136), 25 states have internal predecessors, (136), 17 states have call successors, (31), 2 states have call predecessors, (31), 10 states have return successors, (32), 12 states have call predecessors, (32), 17 states have call successors, (32) [2023-02-18 23:36:40,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2543 transitions. [2023-02-18 23:36:40,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2023-02-18 23:36:40,310 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:36:40,310 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 18, 14, 14, 14, 14, 14, 14, 14, 14, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:36:40,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2023-02-18 23:36:40,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2023-02-18 23:36:40,515 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting binomialCoefficientErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:36:40,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:36:40,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1311340197, now seen corresponding path program 4 times [2023-02-18 23:36:40,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:36:40,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123844051] [2023-02-18 23:36:40,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:36:40,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:36:40,527 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:36:40,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [789014973] [2023-02-18 23:36:40,528 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-18 23:36:40,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:36:40,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:36:40,529 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:36:40,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2023-02-18 23:36:40,671 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-18 23:36:40,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:36:40,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-18 23:36:40,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:36:40,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 269 proven. 67 refuted. 0 times theorem prover too weak. 2476 trivial. 0 not checked. [2023-02-18 23:36:40,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:36:41,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:36:41,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123844051] [2023-02-18 23:36:41,078 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:36:41,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789014973] [2023-02-18 23:36:41,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789014973] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 23:36:41,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 23:36:41,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2023-02-18 23:36:41,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577160321] [2023-02-18 23:36:41,078 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 23:36:41,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-18 23:36:41,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:36:41,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-18 23:36:41,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2023-02-18 23:36:41,079 INFO L87 Difference]: Start difference. First operand 1896 states and 2543 transitions. Second operand has 15 states, 13 states have (on average 4.923076923076923) internal successors, (64), 14 states have internal predecessors, (64), 7 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2023-02-18 23:36:41,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:36:41,601 INFO L93 Difference]: Finished difference Result 1996 states and 2703 transitions. [2023-02-18 23:36:41,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-18 23:36:41,601 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.923076923076923) internal successors, (64), 14 states have internal predecessors, (64), 7 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) Word has length 346 [2023-02-18 23:36:41,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:36:41,606 INFO L225 Difference]: With dead ends: 1996 [2023-02-18 23:36:41,606 INFO L226 Difference]: Without dead ends: 1988 [2023-02-18 23:36:41,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 334 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2023-02-18 23:36:41,607 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 85 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 23:36:41,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 367 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 23:36:41,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2023-02-18 23:36:41,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1940. [2023-02-18 23:36:41,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1940 states, 1528 states have (on average 1.1158376963350785) internal successors, (1705), 1533 states have internal predecessors, (1705), 273 states have call successors, (273), 92 states have call predecessors, (273), 134 states have return successors, (624), 314 states have call predecessors, (624), 266 states have call successors, (624) [2023-02-18 23:36:41,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1940 states and 2602 transitions. [2023-02-18 23:36:41,671 INFO L78 Accepts]: Start accepts. Automaton has 1940 states and 2602 transitions. Word has length 346 [2023-02-18 23:36:41,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:36:41,672 INFO L495 AbstractCegarLoop]: Abstraction has 1940 states and 2602 transitions. [2023-02-18 23:36:41,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.923076923076923) internal successors, (64), 14 states have internal predecessors, (64), 7 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2023-02-18 23:36:41,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1940 states and 2602 transitions. [2023-02-18 23:36:41,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2023-02-18 23:36:41,674 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:36:41,674 INFO L195 NwaCegarLoop]: trace histogram [36, 33, 19, 19, 19, 19, 17, 17, 17, 17, 16, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:36:41,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2023-02-18 23:36:41,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:36:41,879 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting factErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:36:41,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:36:41,879 INFO L85 PathProgramCache]: Analyzing trace with hash 76214845, now seen corresponding path program 8 times [2023-02-18 23:36:41,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:36:41,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161029224] [2023-02-18 23:36:41,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:36:41,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:36:41,892 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:36:41,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1112749609] [2023-02-18 23:36:41,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 23:36:41,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:36:41,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:36:41,894 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:36:41,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2023-02-18 23:36:42,009 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 23:36:42,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:36:42,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 23:36:42,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:36:42,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3484 backedges. 1224 proven. 46 refuted. 0 times theorem prover too weak. 2214 trivial. 0 not checked. [2023-02-18 23:36:42,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:36:42,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3484 backedges. 356 proven. 112 refuted. 0 times theorem prover too weak. 3016 trivial. 0 not checked. [2023-02-18 23:36:42,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:36:42,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161029224] [2023-02-18 23:36:42,087 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:36:42,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112749609] [2023-02-18 23:36:42,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112749609] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:36:42,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:36:42,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2023-02-18 23:36:42,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341209372] [2023-02-18 23:36:42,088 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:36:42,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 23:36:42,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:36:42,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 23:36:42,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-02-18 23:36:42,089 INFO L87 Difference]: Start difference. First operand 1940 states and 2602 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 8 states have internal predecessors, (63), 6 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-18 23:36:42,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:36:42,291 INFO L93 Difference]: Finished difference Result 3404 states and 4664 transitions. [2023-02-18 23:36:42,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 23:36:42,292 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 8 states have internal predecessors, (63), 6 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 373 [2023-02-18 23:36:42,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:36:42,296 INFO L225 Difference]: With dead ends: 3404 [2023-02-18 23:36:42,296 INFO L226 Difference]: Without dead ends: 1874 [2023-02-18 23:36:42,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 750 GetRequests, 728 SyntacticMatches, 8 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2023-02-18 23:36:42,299 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 48 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:36:42,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 535 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:36:42,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2023-02-18 23:36:42,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1869. [2023-02-18 23:36:42,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1869 states, 1469 states have (on average 1.1136827773995917) internal successors, (1636), 1480 states have internal predecessors, (1636), 266 states have call successors, (266), 92 states have call predecessors, (266), 129 states have return successors, (595), 296 states have call predecessors, (595), 259 states have call successors, (595) [2023-02-18 23:36:42,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2497 transitions. [2023-02-18 23:36:42,384 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2497 transitions. Word has length 373 [2023-02-18 23:36:42,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:36:42,384 INFO L495 AbstractCegarLoop]: Abstraction has 1869 states and 2497 transitions. [2023-02-18 23:36:42,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 8 states have internal predecessors, (63), 6 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-18 23:36:42,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2497 transitions. [2023-02-18 23:36:42,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2023-02-18 23:36:42,386 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:36:42,386 INFO L195 NwaCegarLoop]: trace histogram [37, 34, 22, 22, 22, 22, 20, 20, 20, 19, 15, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:36:42,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2023-02-18 23:36:42,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:36:42,591 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting factErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:36:42,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:36:42,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1329178369, now seen corresponding path program 11 times [2023-02-18 23:36:42,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:36:42,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133378877] [2023-02-18 23:36:42,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:36:42,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:36:42,598 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:36:42,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1234455897] [2023-02-18 23:36:42,598 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-18 23:36:42,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:36:42,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:36:42,600 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:36:42,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2023-02-18 23:36:42,744 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2023-02-18 23:36:42,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:36:42,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-18 23:36:42,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:36:42,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3886 backedges. 1169 proven. 410 refuted. 0 times theorem prover too weak. 2307 trivial. 0 not checked. [2023-02-18 23:36:42,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:36:43,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3886 backedges. 1169 proven. 426 refuted. 0 times theorem prover too weak. 2291 trivial. 0 not checked. [2023-02-18 23:36:43,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:36:43,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133378877] [2023-02-18 23:36:43,301 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:36:43,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234455897] [2023-02-18 23:36:43,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234455897] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:36:43,302 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:36:43,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 31] total 46 [2023-02-18 23:36:43,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185802077] [2023-02-18 23:36:43,302 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:36:43,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-18 23:36:43,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:36:43,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-18 23:36:43,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1879, Unknown=0, NotChecked=0, Total=2070 [2023-02-18 23:36:43,304 INFO L87 Difference]: Start difference. First operand 1869 states and 2497 transitions. Second operand has 46 states, 46 states have (on average 3.717391304347826) internal successors, (171), 38 states have internal predecessors, (171), 22 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (32), 18 states have call predecessors, (32), 18 states have call successors, (32) [2023-02-18 23:36:45,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:36:45,153 INFO L93 Difference]: Finished difference Result 4510 states and 6648 transitions. [2023-02-18 23:36:45,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-02-18 23:36:45,154 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.717391304347826) internal successors, (171), 38 states have internal predecessors, (171), 22 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (32), 18 states have call predecessors, (32), 18 states have call successors, (32) Word has length 372 [2023-02-18 23:36:45,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:36:45,163 INFO L225 Difference]: With dead ends: 4510 [2023-02-18 23:36:45,163 INFO L226 Difference]: Without dead ends: 2865 [2023-02-18 23:36:45,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 785 GetRequests, 693 SyntacticMatches, 18 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1447 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=784, Invalid=4916, Unknown=0, NotChecked=0, Total=5700 [2023-02-18 23:36:45,168 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 452 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 2893 mSolverCounterSat, 435 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 3328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 435 IncrementalHoareTripleChecker+Valid, 2893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-18 23:36:45,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 699 Invalid, 3328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [435 Valid, 2893 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-02-18 23:36:45,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2023-02-18 23:36:45,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 2225. [2023-02-18 23:36:45,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2225 states, 1752 states have (on average 1.1141552511415524) internal successors, (1952), 1762 states have internal predecessors, (1952), 316 states have call successors, (316), 109 states have call predecessors, (316), 152 states have return successors, (839), 353 states have call predecessors, (839), 308 states have call successors, (839) [2023-02-18 23:36:45,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 2225 states and 3107 transitions. [2023-02-18 23:36:45,272 INFO L78 Accepts]: Start accepts. Automaton has 2225 states and 3107 transitions. Word has length 372 [2023-02-18 23:36:45,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:36:45,272 INFO L495 AbstractCegarLoop]: Abstraction has 2225 states and 3107 transitions. [2023-02-18 23:36:45,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.717391304347826) internal successors, (171), 38 states have internal predecessors, (171), 22 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (32), 18 states have call predecessors, (32), 18 states have call successors, (32) [2023-02-18 23:36:45,273 INFO L276 IsEmpty]: Start isEmpty. Operand 2225 states and 3107 transitions. [2023-02-18 23:36:45,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2023-02-18 23:36:45,275 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:36:45,275 INFO L195 NwaCegarLoop]: trace histogram [40, 39, 24, 24, 24, 24, 24, 24, 24, 23, 16, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:36:45,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2023-02-18 23:36:45,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:36:45,480 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting factErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-02-18 23:36:45,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:36:45,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1530359745, now seen corresponding path program 12 times [2023-02-18 23:36:45,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:36:45,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154432440] [2023-02-18 23:36:45,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:36:45,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:36:45,489 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 23:36:45,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [23665400] [2023-02-18 23:36:45,489 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-18 23:36:45,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:36:45,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:36:45,490 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 23:36:45,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2023-02-18 23:36:45,653 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2023-02-18 23:36:45,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:36:45,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 49 conjunts are in the unsatisfiable core [2023-02-18 23:36:45,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:36:53,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4934 backedges. 1082 proven. 156 refuted. 0 times theorem prover too weak. 3696 trivial. 0 not checked. [2023-02-18 23:36:53,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:36:55,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:36:55,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154432440] [2023-02-18 23:36:55,371 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 23:36:55,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23665400] [2023-02-18 23:36:55,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23665400] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 23:36:55,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 23:36:55,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2023-02-18 23:36:55,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210214303] [2023-02-18 23:36:55,372 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 23:36:55,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-18 23:36:55,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:36:55,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-18 23:36:55,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=974, Unknown=6, NotChecked=0, Total=1122 [2023-02-18 23:36:55,373 INFO L87 Difference]: Start difference. First operand 2225 states and 3107 transitions. Second operand has 32 states, 30 states have (on average 3.033333333333333) internal successors, (91), 30 states have internal predecessors, (91), 11 states have call successors, (14), 3 states have call predecessors, (14), 6 states have return successors, (14), 11 states have call predecessors, (14), 9 states have call successors, (14) [2023-02-18 23:36:57,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:36:58,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:37:00,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:37:01,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:37:03,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:37:05,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:37:07,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:37:09,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:37:11,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:37:12,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:37:13,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:37:15,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:37:17,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:37:18,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:37:20,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:37:22,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:37:24,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:37:28,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:37:29,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:37:41,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 11.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:37:43,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:37:45,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:37:46,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:37:48,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:37:50,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:37:53,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:37:54,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:37:59,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:38:01,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:38:04,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:38:05,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:38:07,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:38:09,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:38:10,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:38:13,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:38:15,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:38:17,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:38:19,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:38:20,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:38:24,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:38:30,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:38:32,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:38:34,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:38:35,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:38:37,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 23:38:39,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]