./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 c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 --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.5-?-c7c6ca5-m [2024-11-09 11:14:18,851 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:14:18,943 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-09 11:14:18,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:14:18,949 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:14:18,975 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:14:18,976 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:14:18,976 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:14:18,977 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:14:18,977 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:14:18,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:14:18,979 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:14:18,980 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:14:18,983 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:14:18,983 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:14:18,984 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:14:18,984 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:14:18,984 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:14:18,984 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:14:18,985 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:14:18,985 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:14:18,986 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:14:18,986 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:14:18,986 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:14:18,987 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:14:18,987 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:14:18,987 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:14:18,988 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:14:18,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:14:18,988 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:14:18,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:14:18,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:14:18,989 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:14:18,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:14:18,990 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:14:18,990 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:14:18,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:14:18,990 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:14:18,991 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:14:18,991 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:14:18,991 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:14:18,993 INFO L153 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 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 [2024-11-09 11:14:19,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:14:19,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:14:19,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:14:19,259 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:14:19,260 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:14:19,261 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/Binomial.c [2024-11-09 11:14:20,722 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:14:20,929 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:14:20,930 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Binomial.c [2024-11-09 11:14:20,937 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db1ec087b/eaff496e522242ad86a0bc653afa0251/FLAGc3323b9e2 [2024-11-09 11:14:21,309 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db1ec087b/eaff496e522242ad86a0bc653afa0251 [2024-11-09 11:14:21,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:14:21,313 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:14:21,314 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:14:21,314 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:14:21,320 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:14:21,320 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:14:21" (1/1) ... [2024-11-09 11:14:21,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68a840ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:14:21, skipping insertion in model container [2024-11-09 11:14:21,321 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:14:21" (1/1) ... [2024-11-09 11:14:21,337 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:14:21,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:14:21,510 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:14:21,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:14:21,540 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:14:21,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:14:21 WrapperNode [2024-11-09 11:14:21,540 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:14:21,541 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:14:21,541 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:14:21,542 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:14:21,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:14:21" (1/1) ... [2024-11-09 11:14:21,551 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:14:21" (1/1) ... [2024-11-09 11:14:21,564 INFO L138 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2024-11-09 11:14:21,564 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:14:21,565 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:14:21,565 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:14:21,565 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:14:21,575 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:14:21" (1/1) ... [2024-11-09 11:14:21,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:14:21" (1/1) ... [2024-11-09 11:14:21,577 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:14:21" (1/1) ... [2024-11-09 11:14:21,586 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-09 11:14:21,590 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:14:21" (1/1) ... [2024-11-09 11:14:21,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:14:21" (1/1) ... [2024-11-09 11:14:21,594 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:14:21" (1/1) ... [2024-11-09 11:14:21,600 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:14:21" (1/1) ... [2024-11-09 11:14:21,601 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:14:21" (1/1) ... [2024-11-09 11:14:21,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:14:21" (1/1) ... [2024-11-09 11:14:21,603 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:14:21,605 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:14:21,606 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:14:21,606 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:14:21,607 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:14:21" (1/1) ... [2024-11-09 11:14:21,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:14:21,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:14:21,633 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 11:14:21,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 11:14:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure fact [2024-11-09 11:14:21,684 INFO L138 BoogieDeclarations]: Found implementation of procedure fact [2024-11-09 11:14:21,684 INFO L130 BoogieDeclarations]: Found specification of procedure binomialCoefficient [2024-11-09 11:14:21,684 INFO L138 BoogieDeclarations]: Found implementation of procedure binomialCoefficient [2024-11-09 11:14:21,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:14:21,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:14:21,738 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:14:21,740 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:14:21,943 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-11-09 11:14:21,943 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:14:21,961 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:14:21,962 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 11:14:21,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:14:21 BoogieIcfgContainer [2024-11-09 11:14:21,963 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:14:21,966 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:14:21,967 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:14:21,971 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:14:21,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:14:21" (1/3) ... [2024-11-09 11:14:21,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f2ed74a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:14:21, skipping insertion in model container [2024-11-09 11:14:21,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:14:21" (2/3) ... [2024-11-09 11:14:21,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f2ed74a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:14:21, skipping insertion in model container [2024-11-09 11:14:21,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:14:21" (3/3) ... [2024-11-09 11:14:21,974 INFO L112 eAbstractionObserver]: Analyzing ICFG Binomial.c [2024-11-09 11:14:21,990 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:14:21,990 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-11-09 11:14:22,058 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:14:22,067 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@51117dc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:14:22,068 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-09 11:14:22,073 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 52 states have internal predecessors, (60), 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) [2024-11-09 11:14:22,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 11:14:22,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:14:22,080 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:14:22,081 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:14:22,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:14:22,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1898283155, now seen corresponding path program 1 times [2024-11-09 11:14:22,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:14:22,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95470924] [2024-11-09 11:14:22,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:22,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:14:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:22,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:14:22,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:14:22,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95470924] [2024-11-09 11:14:22,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95470924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:14:22,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:14:22,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:14:22,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725496865] [2024-11-09 11:14:22,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:14:22,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 11:14:22,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:14:22,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 11:14:22,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 11:14:22,260 INFO L87 Difference]: Start difference. First operand has 61 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 52 states have internal predecessors, (60), 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.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2024-11-09 11:14:22,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:14:22,280 INFO L93 Difference]: Finished difference Result 118 states and 138 transitions. [2024-11-09 11:14:22,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 11:14:22,282 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2024-11-09 11:14:22,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:14:22,289 INFO L225 Difference]: With dead ends: 118 [2024-11-09 11:14:22,289 INFO L226 Difference]: Without dead ends: 57 [2024-11-09 11:14:22,293 INFO L431 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 [2024-11-09 11:14:22,298 INFO L432 NwaCegarLoop]: 70 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, 70 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 [2024-11-09 11:14:22,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:14:22,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-09 11:14:22,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-09 11:14:22,327 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) [2024-11-09 11:14:22,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2024-11-09 11:14:22,330 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 9 [2024-11-09 11:14:22,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:14:22,330 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2024-11-09 11:14:22,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2024-11-09 11:14:22,331 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2024-11-09 11:14:22,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 11:14:22,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:14:22,332 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:14:22,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:14:22,332 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:14:22,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:14:22,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1897717126, now seen corresponding path program 1 times [2024-11-09 11:14:22,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:14:22,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452963858] [2024-11-09 11:14:22,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:22,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:14:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:22,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:14:22,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:14:22,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452963858] [2024-11-09 11:14:22,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452963858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:14:22,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:14:22,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:14:22,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445566848] [2024-11-09 11:14:22,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:14:22,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:14:22,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:14:22,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:14:22,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:14:22,404 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) [2024-11-09 11:14:22,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:14:22,479 INFO L93 Difference]: Finished difference Result 111 states and 126 transitions. [2024-11-09 11:14:22,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:14:22,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2024-11-09 11:14:22,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:14:22,481 INFO L225 Difference]: With dead ends: 111 [2024-11-09 11:14:22,481 INFO L226 Difference]: Without dead ends: 58 [2024-11-09 11:14:22,482 INFO L431 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 [2024-11-09 11:14:22,483 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 24 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:14:22,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 149 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:14:22,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-09 11:14:22,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-09 11:14:22,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 49 states have internal predecessors, (53), 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) [2024-11-09 11:14:22,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2024-11-09 11:14:22,502 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 9 [2024-11-09 11:14:22,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:14:22,502 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2024-11-09 11:14:22,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) [2024-11-09 11:14:22,502 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2024-11-09 11:14:22,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 11:14:22,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:14:22,503 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:14:22,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 11:14:22,503 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:14:22,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:14:22,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1419301016, now seen corresponding path program 1 times [2024-11-09 11:14:22,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:14:22,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712705998] [2024-11-09 11:14:22,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:22,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:14:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:22,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:14:22,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:14:22,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712705998] [2024-11-09 11:14:22,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712705998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:14:22,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:14:22,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:14:22,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439528508] [2024-11-09 11:14:22,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:14:22,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:14:22,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:14:22,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:14:22,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:14:22,637 INFO L87 Difference]: Start difference. First operand 58 states and 65 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) [2024-11-09 11:14:22,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:14:22,671 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2024-11-09 11:14:22,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:14:22,672 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 [2024-11-09 11:14:22,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:14:22,674 INFO L225 Difference]: With dead ends: 58 [2024-11-09 11:14:22,674 INFO L226 Difference]: Without dead ends: 57 [2024-11-09 11:14:22,674 INFO L431 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 [2024-11-09 11:14:22,676 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 4 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:14:22,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 107 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:14:22,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-09 11:14:22,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-09 11:14:22,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.4444444444444444) 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) [2024-11-09 11:14:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2024-11-09 11:14:22,687 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 13 [2024-11-09 11:14:22,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:14:22,687 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2024-11-09 11:14:22,687 INFO L472 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) [2024-11-09 11:14:22,687 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2024-11-09 11:14:22,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 11:14:22,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:14:22,688 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:14:22,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 11:14:22,689 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:14:22,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:14:22,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1048658574, now seen corresponding path program 1 times [2024-11-09 11:14:22,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:14:22,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710776168] [2024-11-09 11:14:22,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:22,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:14:22,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:22,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:14:22,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:14:22,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710776168] [2024-11-09 11:14:22,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710776168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:14:22,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:14:22,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 11:14:22,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934372736] [2024-11-09 11:14:22,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:14:22,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 11:14:22,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:14:22,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 11:14:22,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:14:22,829 INFO L87 Difference]: Start difference. First operand 57 states and 64 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) [2024-11-09 11:14:22,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:14:22,963 INFO L93 Difference]: Finished difference Result 150 states and 172 transitions. [2024-11-09 11:14:22,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 11:14:22,964 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 [2024-11-09 11:14:22,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:14:22,966 INFO L225 Difference]: With dead ends: 150 [2024-11-09 11:14:22,966 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 11:14:22,967 INFO L431 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 [2024-11-09 11:14:22,968 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 44 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:14:22,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 335 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:14:22,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 11:14:22,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2024-11-09 11:14:22,983 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) [2024-11-09 11:14:22,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 107 transitions. [2024-11-09 11:14:22,987 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 107 transitions. Word has length 14 [2024-11-09 11:14:22,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:14:22,988 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 107 transitions. [2024-11-09 11:14:22,988 INFO L472 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) [2024-11-09 11:14:22,988 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 107 transitions. [2024-11-09 11:14:22,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 11:14:22,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:14:22,989 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:14:22,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 11:14:22,989 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:14:22,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:14:22,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1204972684, now seen corresponding path program 1 times [2024-11-09 11:14:22,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:14:22,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746896327] [2024-11-09 11:14:22,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:22,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:14:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:23,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:14:23,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:14:23,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746896327] [2024-11-09 11:14:23,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746896327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:14:23,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:14:23,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:14:23,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380492274] [2024-11-09 11:14:23,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:14:23,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:14:23,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:14:23,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:14:23,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:14:23,044 INFO L87 Difference]: Start difference. First operand 87 states and 107 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) [2024-11-09 11:14:23,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:14:23,112 INFO L93 Difference]: Finished difference Result 175 states and 214 transitions. [2024-11-09 11:14:23,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:14:23,115 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 [2024-11-09 11:14:23,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:14:23,116 INFO L225 Difference]: With dead ends: 175 [2024-11-09 11:14:23,116 INFO L226 Difference]: Without dead ends: 94 [2024-11-09 11:14:23,117 INFO L431 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 [2024-11-09 11:14:23,118 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 19 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:14:23,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 163 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:14:23,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-09 11:14:23,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2024-11-09 11:14:23,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 72 states have internal predecessors, (86), 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) [2024-11-09 11:14:23,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2024-11-09 11:14:23,128 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 14 [2024-11-09 11:14:23,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:14:23,128 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2024-11-09 11:14:23,129 INFO L472 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) [2024-11-09 11:14:23,129 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2024-11-09 11:14:23,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 11:14:23,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:14:23,130 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:14:23,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 11:14:23,130 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:14:23,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:14:23,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1152590759, now seen corresponding path program 1 times [2024-11-09 11:14:23,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:14:23,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557505677] [2024-11-09 11:14:23,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:23,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:14:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:23,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:14:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:23,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:14:23,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:14:23,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557505677] [2024-11-09 11:14:23,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557505677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:14:23,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:14:23,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 11:14:23,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503823092] [2024-11-09 11:14:23,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:14:23,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 11:14:23,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:14:23,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 11:14:23,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:14:23,227 INFO L87 Difference]: Start difference. First operand 88 states and 108 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) [2024-11-09 11:14:23,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:14:23,368 INFO L93 Difference]: Finished difference Result 218 states and 276 transitions. [2024-11-09 11:14:23,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 11:14:23,368 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 [2024-11-09 11:14:23,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:14:23,370 INFO L225 Difference]: With dead ends: 218 [2024-11-09 11:14:23,370 INFO L226 Difference]: Without dead ends: 137 [2024-11-09 11:14:23,371 INFO L431 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 [2024-11-09 11:14:23,372 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 36 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:14:23,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 322 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:14:23,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-09 11:14:23,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 125. [2024-11-09 11:14:23,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 100 states have internal predecessors, (125), 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) [2024-11-09 11:14:23,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 163 transitions. [2024-11-09 11:14:23,400 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 163 transitions. Word has length 20 [2024-11-09 11:14:23,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:14:23,400 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 163 transitions. [2024-11-09 11:14:23,400 INFO L472 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) [2024-11-09 11:14:23,401 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 163 transitions. [2024-11-09 11:14:23,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 11:14:23,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:14:23,402 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:14:23,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 11:14:23,403 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting binomialCoefficientErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:14:23,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:14:23,403 INFO L85 PathProgramCache]: Analyzing trace with hash 461279503, now seen corresponding path program 1 times [2024-11-09 11:14:23,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:14:23,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373113831] [2024-11-09 11:14:23,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:23,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:14:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:23,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:14:23,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:23,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:14:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:23,522 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:14:23,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:14:23,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373113831] [2024-11-09 11:14:23,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373113831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:14:23,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:14:23,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:14:23,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822874759] [2024-11-09 11:14:23,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:14:23,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:14:23,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:14:23,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:14:23,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:14:23,524 INFO L87 Difference]: Start difference. First operand 125 states and 163 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) [2024-11-09 11:14:23,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:14:23,637 INFO L93 Difference]: Finished difference Result 152 states and 190 transitions. [2024-11-09 11:14:23,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 11:14:23,638 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 [2024-11-09 11:14:23,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:14:23,650 INFO L225 Difference]: With dead ends: 152 [2024-11-09 11:14:23,650 INFO L226 Difference]: Without dead ends: 151 [2024-11-09 11:14:23,651 INFO L431 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 [2024-11-09 11:14:23,652 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 46 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:14:23,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 250 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:14:23,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-09 11:14:23,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 140. [2024-11-09 11:14:23,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 97 states have (on average 1.422680412371134) internal successors, (138), 111 states have internal predecessors, (138), 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) [2024-11-09 11:14:23,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 182 transitions. [2024-11-09 11:14:23,676 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 182 transitions. Word has length 22 [2024-11-09 11:14:23,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:14:23,677 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 182 transitions. [2024-11-09 11:14:23,677 INFO L472 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) [2024-11-09 11:14:23,677 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 182 transitions. [2024-11-09 11:14:23,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 11:14:23,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:14:23,678 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:14:23,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 11:14:23,678 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting binomialCoefficientErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:14:23,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:14:23,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1414762759, now seen corresponding path program 1 times [2024-11-09 11:14:23,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:14:23,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483106526] [2024-11-09 11:14:23,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:23,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:14:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:23,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:14:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:23,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:14:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:23,768 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:14:23,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:14:23,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483106526] [2024-11-09 11:14:23,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483106526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:14:23,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:14:23,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:14:23,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201555972] [2024-11-09 11:14:23,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:14:23,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:14:23,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:14:23,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:14:23,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:14:23,773 INFO L87 Difference]: Start difference. First operand 140 states and 182 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) [2024-11-09 11:14:23,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:14:23,866 INFO L93 Difference]: Finished difference Result 152 states and 187 transitions. [2024-11-09 11:14:23,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 11:14:23,867 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 [2024-11-09 11:14:23,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:14:23,868 INFO L225 Difference]: With dead ends: 152 [2024-11-09 11:14:23,869 INFO L226 Difference]: Without dead ends: 151 [2024-11-09 11:14:23,869 INFO L431 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 [2024-11-09 11:14:23,871 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 46 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:14:23,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 256 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:14:23,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-09 11:14:23,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 140. [2024-11-09 11:14:23,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 97 states have (on average 1.4123711340206186) internal successors, (137), 111 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) [2024-11-09 11:14:23,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 181 transitions. [2024-11-09 11:14:23,889 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 181 transitions. Word has length 23 [2024-11-09 11:14:23,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:14:23,889 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 181 transitions. [2024-11-09 11:14:23,889 INFO L472 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) [2024-11-09 11:14:23,889 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 181 transitions. [2024-11-09 11:14:23,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 11:14:23,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:14:23,890 INFO L215 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] [2024-11-09 11:14:23,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 11:14:23,891 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:14:23,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:14:23,891 INFO L85 PathProgramCache]: Analyzing trace with hash -376350556, now seen corresponding path program 1 times [2024-11-09 11:14:23,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:14:23,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41186901] [2024-11-09 11:14:23,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:23,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:14:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:24,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:14:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:24,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:14:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:24,010 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:14:24,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:14:24,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41186901] [2024-11-09 11:14:24,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41186901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:14:24,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:14:24,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 11:14:24,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075078907] [2024-11-09 11:14:24,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:14:24,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 11:14:24,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:14:24,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 11:14:24,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:14:24,013 INFO L87 Difference]: Start difference. First operand 140 states and 181 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) [2024-11-09 11:14:24,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:14:24,141 INFO L93 Difference]: Finished difference Result 279 states and 353 transitions. [2024-11-09 11:14:24,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 11:14:24,141 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 [2024-11-09 11:14:24,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:14:24,143 INFO L225 Difference]: With dead ends: 279 [2024-11-09 11:14:24,143 INFO L226 Difference]: Without dead ends: 155 [2024-11-09 11:14:24,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-09 11:14:24,144 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 48 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:14:24,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 345 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:14:24,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-09 11:14:24,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 144. [2024-11-09 11:14:24,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 100 states have (on average 1.4) internal successors, (140), 114 states have internal predecessors, (140), 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) [2024-11-09 11:14:24,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 184 transitions. [2024-11-09 11:14:24,154 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 184 transitions. Word has length 28 [2024-11-09 11:14:24,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:14:24,155 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 184 transitions. [2024-11-09 11:14:24,155 INFO L472 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) [2024-11-09 11:14:24,155 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 184 transitions. [2024-11-09 11:14:24,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 11:14:24,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:14:24,156 INFO L215 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] [2024-11-09 11:14:24,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 11:14:24,156 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting binomialCoefficientErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:14:24,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:14:24,157 INFO L85 PathProgramCache]: Analyzing trace with hash -896192804, now seen corresponding path program 1 times [2024-11-09 11:14:24,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:14:24,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470698586] [2024-11-09 11:14:24,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:24,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:14:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:14:24,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1450021814] [2024-11-09 11:14:24,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:24,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:14:24,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:14:24,168 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) [2024-11-09 11:14:24,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 11:14:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:24,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:14:24,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:14:24,295 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 11:14:24,297 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:14:24,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:14:24,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470698586] [2024-11-09 11:14:24,298 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:14:24,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450021814] [2024-11-09 11:14:24,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450021814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:14:24,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:14:24,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:14:24,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456138308] [2024-11-09 11:14:24,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:14:24,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:14:24,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:14:24,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:14:24,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:14:24,299 INFO L87 Difference]: Start difference. First operand 144 states and 184 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) [2024-11-09 11:14:24,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:14:24,353 INFO L93 Difference]: Finished difference Result 196 states and 281 transitions. [2024-11-09 11:14:24,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:14:24,354 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 [2024-11-09 11:14:24,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:14:24,356 INFO L225 Difference]: With dead ends: 196 [2024-11-09 11:14:24,356 INFO L226 Difference]: Without dead ends: 195 [2024-11-09 11:14:24,356 INFO L431 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 [2024-11-09 11:14:24,357 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 12 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:14:24,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 162 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:14:24,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-09 11:14:24,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 166. [2024-11-09 11:14:24,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 118 states have (on average 1.3644067796610169) internal successors, (161), 129 states have internal predecessors, (161), 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) [2024-11-09 11:14:24,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 225 transitions. [2024-11-09 11:14:24,371 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 225 transitions. Word has length 30 [2024-11-09 11:14:24,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:14:24,372 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 225 transitions. [2024-11-09 11:14:24,372 INFO L472 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) [2024-11-09 11:14:24,372 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 225 transitions. [2024-11-09 11:14:24,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 11:14:24,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:14:24,373 INFO L215 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] [2024-11-09 11:14:24,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 11:14:24,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 11:14:24,574 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting binomialCoefficientErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:14:24,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:14:24,575 INFO L85 PathProgramCache]: Analyzing trace with hash -2012173088, now seen corresponding path program 1 times [2024-11-09 11:14:24,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:14:24,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036889882] [2024-11-09 11:14:24,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:24,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:14:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:14:24,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [48864300] [2024-11-09 11:14:24,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:24,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:14:24,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:14:24,595 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) [2024-11-09 11:14:24,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 11:14:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:24,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 11:14:24,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:14:24,703 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 11:14:24,703 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:14:24,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:14:24,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036889882] [2024-11-09 11:14:24,890 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:14:24,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48864300] [2024-11-09 11:14:24,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48864300] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:14:24,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:14:24,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2024-11-09 11:14:24,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220994358] [2024-11-09 11:14:24,891 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 11:14:24,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:14:24,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:14:24,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:14:24,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:14:24,892 INFO L87 Difference]: Start difference. First operand 166 states and 225 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:14:24,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:14:24,960 INFO L93 Difference]: Finished difference Result 196 states and 276 transitions. [2024-11-09 11:14:24,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:14:24,960 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2024-11-09 11:14:24,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:14:24,962 INFO L225 Difference]: With dead ends: 196 [2024-11-09 11:14:24,962 INFO L226 Difference]: Without dead ends: 195 [2024-11-09 11:14:24,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:14:24,963 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 8 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:14:24,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 260 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:14:24,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-09 11:14:24,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 170. [2024-11-09 11:14:24,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 122 states have (on average 1.3442622950819672) internal successors, (164), 133 states have internal predecessors, (164), 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) [2024-11-09 11:14:24,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 228 transitions. [2024-11-09 11:14:24,986 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 228 transitions. Word has length 31 [2024-11-09 11:14:24,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:14:24,986 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 228 transitions. [2024-11-09 11:14:24,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:14:24,987 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 228 transitions. [2024-11-09 11:14:24,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 11:14:24,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:14:24,987 INFO L215 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] [2024-11-09 11:14:25,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 11:14:25,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 11:14:25,188 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting binomialCoefficientErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:14:25,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:14:25,189 INFO L85 PathProgramCache]: Analyzing trace with hash 2047143774, now seen corresponding path program 1 times [2024-11-09 11:14:25,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:14:25,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717639215] [2024-11-09 11:14:25,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:25,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:14:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:14:25,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1497684763] [2024-11-09 11:14:25,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:25,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:14:25,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:14:25,206 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) [2024-11-09 11:14:25,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 11:14:25,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:25,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 11:14:25,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:14:25,350 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:14:25,351 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:14:25,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:14:25,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717639215] [2024-11-09 11:14:25,352 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:14:25,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497684763] [2024-11-09 11:14:25,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497684763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:14:25,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:14:25,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:14:25,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132571898] [2024-11-09 11:14:25,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:14:25,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:14:25,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:14:25,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:14:25,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:14:25,354 INFO L87 Difference]: Start difference. First operand 170 states and 228 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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) [2024-11-09 11:14:25,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:14:25,432 INFO L93 Difference]: Finished difference Result 251 states and 355 transitions. [2024-11-09 11:14:25,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:14:25,434 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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 [2024-11-09 11:14:25,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:14:25,436 INFO L225 Difference]: With dead ends: 251 [2024-11-09 11:14:25,436 INFO L226 Difference]: Without dead ends: 249 [2024-11-09 11:14:25,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:14:25,437 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 21 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:14:25,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 224 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:14:25,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-09 11:14:25,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 205. [2024-11-09 11:14:25,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 151 states have (on average 1.2913907284768211) internal successors, (195), 159 states have internal predecessors, (195), 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) [2024-11-09 11:14:25,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 276 transitions. [2024-11-09 11:14:25,460 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 276 transitions. Word has length 32 [2024-11-09 11:14:25,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:14:25,460 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 276 transitions. [2024-11-09 11:14:25,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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) [2024-11-09 11:14:25,461 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 276 transitions. [2024-11-09 11:14:25,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 11:14:25,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:14:25,462 INFO L215 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] [2024-11-09 11:14:25,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 11:14:25,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:14:25,663 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:14:25,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:14:25,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1243028580, now seen corresponding path program 1 times [2024-11-09 11:14:25,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:14:25,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320008000] [2024-11-09 11:14:25,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:25,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:14:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:25,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:14:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:25,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 11:14:25,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:25,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:14:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:25,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:14:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:25,731 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:14:25,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:14:25,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320008000] [2024-11-09 11:14:25,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320008000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:14:25,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:14:25,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:14:25,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785924154] [2024-11-09 11:14:25,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:14:25,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:14:25,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:14:25,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:14:25,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:14:25,735 INFO L87 Difference]: Start difference. First operand 205 states and 276 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) [2024-11-09 11:14:25,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:14:25,762 INFO L93 Difference]: Finished difference Result 205 states and 276 transitions. [2024-11-09 11:14:25,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:14:25,763 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 [2024-11-09 11:14:25,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:14:25,764 INFO L225 Difference]: With dead ends: 205 [2024-11-09 11:14:25,765 INFO L226 Difference]: Without dead ends: 204 [2024-11-09 11:14:25,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:14:25,765 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 3 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:14:25,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 154 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:14:25,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-09 11:14:25,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-11-09 11:14:25,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 151 states have (on average 1.2781456953642385) internal successors, (193), 158 states have internal predecessors, (193), 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) [2024-11-09 11:14:25,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 274 transitions. [2024-11-09 11:14:25,786 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 274 transitions. Word has length 38 [2024-11-09 11:14:25,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:14:25,786 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 274 transitions. [2024-11-09 11:14:25,786 INFO L472 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) [2024-11-09 11:14:25,786 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 274 transitions. [2024-11-09 11:14:25,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 11:14:25,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:14:25,788 INFO L215 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] [2024-11-09 11:14:25,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 11:14:25,789 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:14:25,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:14:25,789 INFO L85 PathProgramCache]: Analyzing trace with hash 120819793, now seen corresponding path program 1 times [2024-11-09 11:14:25,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:14:25,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283329882] [2024-11-09 11:14:25,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:25,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:14:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:25,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:14:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:25,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 11:14:25,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:25,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:14:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:25,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:14:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:25,856 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:14:25,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:14:25,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283329882] [2024-11-09 11:14:25,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283329882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:14:25,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:14:25,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:14:25,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076010241] [2024-11-09 11:14:25,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:14:25,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:14:25,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:14:25,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:14:25,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:14:25,859 INFO L87 Difference]: Start difference. First operand 204 states and 274 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) [2024-11-09 11:14:25,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:14:25,887 INFO L93 Difference]: Finished difference Result 215 states and 287 transitions. [2024-11-09 11:14:25,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:14:25,888 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 [2024-11-09 11:14:25,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:14:25,889 INFO L225 Difference]: With dead ends: 215 [2024-11-09 11:14:25,889 INFO L226 Difference]: Without dead ends: 214 [2024-11-09 11:14:25,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:14:25,890 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:14:25,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 171 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:14:25,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-09 11:14:25,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2024-11-09 11:14:25,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 160 states have (on average 1.2625) internal successors, (202), 165 states have internal predecessors, (202), 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) [2024-11-09 11:14:25,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 285 transitions. [2024-11-09 11:14:25,908 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 285 transitions. Word has length 39 [2024-11-09 11:14:25,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:14:25,909 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 285 transitions. [2024-11-09 11:14:25,909 INFO L472 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) [2024-11-09 11:14:25,909 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 285 transitions. [2024-11-09 11:14:25,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 11:14:25,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:14:25,912 INFO L215 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] [2024-11-09 11:14:25,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 11:14:25,913 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:14:25,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:14:25,913 INFO L85 PathProgramCache]: Analyzing trace with hash 663521416, now seen corresponding path program 1 times [2024-11-09 11:14:25,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:14:25,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658526364] [2024-11-09 11:14:25,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:25,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:14:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:25,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:14:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:25,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 11:14:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:25,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:14:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:26,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:14:26,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:26,004 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 11:14:26,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:14:26,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658526364] [2024-11-09 11:14:26,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658526364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:14:26,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:14:26,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:14:26,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781942919] [2024-11-09 11:14:26,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:14:26,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:14:26,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:14:26,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:14:26,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:14:26,006 INFO L87 Difference]: Start difference. First operand 214 states and 285 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) [2024-11-09 11:14:26,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:14:26,028 INFO L93 Difference]: Finished difference Result 214 states and 285 transitions. [2024-11-09 11:14:26,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:14:26,029 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 [2024-11-09 11:14:26,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:14:26,031 INFO L225 Difference]: With dead ends: 214 [2024-11-09 11:14:26,031 INFO L226 Difference]: Without dead ends: 213 [2024-11-09 11:14:26,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:14:26,032 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 4 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 148 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 [2024-11-09 11:14:26,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 148 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:14:26,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-09 11:14:26,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2024-11-09 11:14:26,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 160 states have (on average 1.25625) 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) [2024-11-09 11:14:26,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2024-11-09 11:14:26,045 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 43 [2024-11-09 11:14:26,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:14:26,046 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2024-11-09 11:14:26,046 INFO L472 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) [2024-11-09 11:14:26,046 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2024-11-09 11:14:26,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 11:14:26,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:14:26,047 INFO L215 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, 1] [2024-11-09 11:14:26,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 11:14:26,047 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:14:26,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:14:26,048 INFO L85 PathProgramCache]: Analyzing trace with hash -905672465, now seen corresponding path program 1 times [2024-11-09 11:14:26,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:14:26,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568469489] [2024-11-09 11:14:26,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:26,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:14:26,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:26,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:14:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:26,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 11:14:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:26,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:14:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:26,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:14:26,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:26,106 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 11:14:26,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:14:26,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568469489] [2024-11-09 11:14:26,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568469489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:14:26,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:14:26,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:14:26,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417565420] [2024-11-09 11:14:26,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:14:26,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:14:26,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:14:26,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:14:26,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:14:26,108 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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) [2024-11-09 11:14:26,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:14:26,135 INFO L93 Difference]: Finished difference Result 219 states and 289 transitions. [2024-11-09 11:14:26,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:14:26,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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 44 [2024-11-09 11:14:26,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:14:26,137 INFO L225 Difference]: With dead ends: 219 [2024-11-09 11:14:26,138 INFO L226 Difference]: Without dead ends: 218 [2024-11-09 11:14:26,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:14:26,138 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 3 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:14:26,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 165 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:14:26,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-09 11:14:26,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2024-11-09 11:14:26,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 164 states have (on average 1.25) internal successors, (205), 168 states have internal predecessors, (205), 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) [2024-11-09 11:14:26,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 288 transitions. [2024-11-09 11:14:26,151 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 288 transitions. Word has length 44 [2024-11-09 11:14:26,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:14:26,151 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 288 transitions. [2024-11-09 11:14:26,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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) [2024-11-09 11:14:26,152 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2024-11-09 11:14:26,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 11:14:26,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:14:26,152 INFO L215 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] [2024-11-09 11:14:26,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 11:14:26,152 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:14:26,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:14:26,153 INFO L85 PathProgramCache]: Analyzing trace with hash 249516746, now seen corresponding path program 1 times [2024-11-09 11:14:26,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:14:26,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790247838] [2024-11-09 11:14:26,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:26,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:14:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:26,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:14:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:26,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 11:14:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:26,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:14:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:26,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:14:26,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:26,302 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:14:26,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:14:26,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790247838] [2024-11-09 11:14:26,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790247838] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:14:26,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704828407] [2024-11-09 11:14:26,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:26,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:14:26,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:14:26,304 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) [2024-11-09 11:14:26,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 11:14:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:26,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 11:14:26,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:14:26,395 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:14:26,396 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:14:26,517 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:14:26,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704828407] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:14:26,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:14:26,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-09 11:14:26,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822242175] [2024-11-09 11:14:26,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:14:26,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 11:14:26,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:14:26,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 11:14:26,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-09 11:14:26,520 INFO L87 Difference]: Start difference. First operand 217 states and 288 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) [2024-11-09 11:14:26,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:14:26,904 INFO L93 Difference]: Finished difference Result 304 states and 396 transitions. [2024-11-09 11:14:26,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 11:14:26,905 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 [2024-11-09 11:14:26,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:14:26,907 INFO L225 Difference]: With dead ends: 304 [2024-11-09 11:14:26,907 INFO L226 Difference]: Without dead ends: 303 [2024-11-09 11:14:26,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2024-11-09 11:14:26,908 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 121 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 11:14:26,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 651 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 11:14:26,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-09 11:14:26,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 280. [2024-11-09 11:14:26,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 212 states have (on average 1.2877358490566038) internal successors, (273), 218 states have internal predecessors, (273), 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) [2024-11-09 11:14:26,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 384 transitions. [2024-11-09 11:14:26,937 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 384 transitions. Word has length 48 [2024-11-09 11:14:26,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:14:26,938 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 384 transitions. [2024-11-09 11:14:26,938 INFO L472 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) [2024-11-09 11:14:26,938 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 384 transitions. [2024-11-09 11:14:26,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 11:14:26,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:14:26,939 INFO L215 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] [2024-11-09 11:14:26,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 11:14:27,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 11:14:27,144 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:14:27,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:14:27,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1302881257, now seen corresponding path program 1 times [2024-11-09 11:14:27,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:14:27,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446841151] [2024-11-09 11:14:27,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:27,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:14:27,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:27,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:14:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:27,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 11:14:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:27,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:14:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:27,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:14:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:27,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 11:14:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:27,234 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 11:14:27,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:14:27,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446841151] [2024-11-09 11:14:27,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446841151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:14:27,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:14:27,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 11:14:27,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299735321] [2024-11-09 11:14:27,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:14:27,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:14:27,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:14:27,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:14:27,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:14:27,236 INFO L87 Difference]: Start difference. First operand 280 states and 384 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 3 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) [2024-11-09 11:14:27,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:14:27,339 INFO L93 Difference]: Finished difference Result 511 states and 705 transitions. [2024-11-09 11:14:27,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 11:14:27,340 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 3 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 54 [2024-11-09 11:14:27,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:14:27,341 INFO L225 Difference]: With dead ends: 511 [2024-11-09 11:14:27,341 INFO L226 Difference]: Without dead ends: 265 [2024-11-09 11:14:27,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:14:27,343 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 15 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:14:27,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 239 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:14:27,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-09 11:14:27,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 264. [2024-11-09 11:14:27,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 202 states have (on average 1.2772277227722773) internal successors, (258), 209 states have internal predecessors, (258), 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) [2024-11-09 11:14:27,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 356 transitions. [2024-11-09 11:14:27,359 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 356 transitions. Word has length 54 [2024-11-09 11:14:27,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:14:27,359 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 356 transitions. [2024-11-09 11:14:27,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 3 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) [2024-11-09 11:14:27,359 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 356 transitions. [2024-11-09 11:14:27,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 11:14:27,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:14:27,360 INFO L215 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] [2024-11-09 11:14:27,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 11:14:27,361 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:14:27,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:14:27,361 INFO L85 PathProgramCache]: Analyzing trace with hash 383045525, now seen corresponding path program 2 times [2024-11-09 11:14:27,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:14:27,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408896102] [2024-11-09 11:14:27,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:27,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:14:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:27,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:14:27,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:27,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 11:14:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:27,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:14:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:27,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:14:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:27,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 11:14:27,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:27,498 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 11:14:27,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:14:27,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408896102] [2024-11-09 11:14:27,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408896102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:14:27,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:14:27,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 11:14:27,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449361803] [2024-11-09 11:14:27,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:14:27,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 11:14:27,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:14:27,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 11:14:27,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:14:27,500 INFO L87 Difference]: Start difference. First operand 264 states and 356 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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) [2024-11-09 11:14:27,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:14:27,717 INFO L93 Difference]: Finished difference Result 507 states and 695 transitions. [2024-11-09 11:14:27,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 11:14:27,718 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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 [2024-11-09 11:14:27,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:14:27,720 INFO L225 Difference]: With dead ends: 507 [2024-11-09 11:14:27,720 INFO L226 Difference]: Without dead ends: 281 [2024-11-09 11:14:27,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:14:27,721 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 41 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:14:27,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 404 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:14:27,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-09 11:14:27,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 275. [2024-11-09 11:14:27,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 210 states have (on average 1.2952380952380953) internal successors, (272), 217 states have internal predecessors, (272), 39 states have call successors, (39), 12 states have call predecessors, (39), 15 states have return successors, (63), 45 states have call predecessors, (63), 39 states have call successors, (63) [2024-11-09 11:14:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 374 transitions. [2024-11-09 11:14:27,738 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 374 transitions. Word has length 54 [2024-11-09 11:14:27,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:14:27,738 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 374 transitions. [2024-11-09 11:14:27,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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) [2024-11-09 11:14:27,739 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 374 transitions. [2024-11-09 11:14:27,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 11:14:27,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:14:27,740 INFO L215 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] [2024-11-09 11:14:27,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 11:14:27,740 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:14:27,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:14:27,740 INFO L85 PathProgramCache]: Analyzing trace with hash -744620115, now seen corresponding path program 1 times [2024-11-09 11:14:27,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:14:27,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982928332] [2024-11-09 11:14:27,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:27,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:14:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:14:27,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [418175892] [2024-11-09 11:14:27,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:27,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:14:27,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:14:27,755 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) [2024-11-09 11:14:27,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 11:14:27,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:27,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:14:27,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:14:27,853 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 11:14:27,854 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:14:27,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:14:27,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982928332] [2024-11-09 11:14:27,854 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:14:27,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418175892] [2024-11-09 11:14:27,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418175892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:14:27,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:14:27,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:14:27,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699526729] [2024-11-09 11:14:27,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:14:27,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:14:27,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:14:27,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:14:27,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:14:27,856 INFO L87 Difference]: Start difference. First operand 275 states and 374 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) [2024-11-09 11:14:27,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:14:27,885 INFO L93 Difference]: Finished difference Result 275 states and 374 transitions. [2024-11-09 11:14:27,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:14:27,885 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 [2024-11-09 11:14:27,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:14:27,887 INFO L225 Difference]: With dead ends: 275 [2024-11-09 11:14:27,887 INFO L226 Difference]: Without dead ends: 274 [2024-11-09 11:14:27,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:14:27,889 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 2 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:14:27,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 153 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:14:27,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-09 11:14:27,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2024-11-09 11:14:27,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 210 states have (on average 1.2809523809523808) internal successors, (269), 216 states have internal predecessors, (269), 39 states have call successors, (39), 12 states have call predecessors, (39), 15 states have return successors, (63), 45 states have call predecessors, (63), 39 states have call successors, (63) [2024-11-09 11:14:27,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 371 transitions. [2024-11-09 11:14:27,918 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 371 transitions. Word has length 55 [2024-11-09 11:14:27,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:14:27,919 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 371 transitions. [2024-11-09 11:14:27,919 INFO L472 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) [2024-11-09 11:14:27,919 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 371 transitions. [2024-11-09 11:14:27,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 11:14:27,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:14:27,920 INFO L215 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, 1] [2024-11-09 11:14:27,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 11:14:28,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:14:28,121 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:14:28,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:14:28,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1364436842, now seen corresponding path program 1 times [2024-11-09 11:14:28,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:14:28,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935881174] [2024-11-09 11:14:28,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:28,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:14:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:28,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:14:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:28,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 11:14:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:28,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:14:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:28,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:14:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:28,233 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:14:28,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:14:28,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935881174] [2024-11-09 11:14:28,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935881174] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:14:28,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814759319] [2024-11-09 11:14:28,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:28,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:14:28,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:14:28,235 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) [2024-11-09 11:14:28,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 11:14:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:28,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 11:14:28,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:14:28,409 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:14:28,410 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:14:28,506 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:14:28,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814759319] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:14:28,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:14:28,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2024-11-09 11:14:28,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325902461] [2024-11-09 11:14:28,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:14:28,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 11:14:28,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:14:28,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 11:14:28,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-09 11:14:28,509 INFO L87 Difference]: Start difference. First operand 274 states and 371 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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) [2024-11-09 11:14:28,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:14:28,640 INFO L93 Difference]: Finished difference Result 516 states and 706 transitions. [2024-11-09 11:14:28,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 11:14:28,641 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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 54 [2024-11-09 11:14:28,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:14:28,643 INFO L225 Difference]: With dead ends: 516 [2024-11-09 11:14:28,643 INFO L226 Difference]: Without dead ends: 285 [2024-11-09 11:14:28,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 103 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-09 11:14:28,645 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 19 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:14:28,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 403 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:14:28,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-09 11:14:28,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 278. [2024-11-09 11:14:28,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 214 states have (on average 1.2710280373831775) internal successors, (272), 220 states have internal predecessors, (272), 39 states have call successors, (39), 12 states have call predecessors, (39), 15 states have return successors, (63), 45 states have call predecessors, (63), 39 states have call successors, (63) [2024-11-09 11:14:28,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 374 transitions. [2024-11-09 11:14:28,660 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 374 transitions. Word has length 54 [2024-11-09 11:14:28,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:14:28,661 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 374 transitions. [2024-11-09 11:14:28,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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) [2024-11-09 11:14:28,661 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 374 transitions. [2024-11-09 11:14:28,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 11:14:28,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:14:28,662 INFO L215 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] [2024-11-09 11:14:28,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 11:14:28,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:14:28,863 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting factErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:14:28,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:14:28,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1608387041, now seen corresponding path program 1 times [2024-11-09 11:14:28,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:14:28,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877271672] [2024-11-09 11:14:28,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:28,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:14:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:14:28,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1549602084] [2024-11-09 11:14:28,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:28,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:14:28,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:14:28,882 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) [2024-11-09 11:14:28,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 11:14:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:28,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 11:14:28,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:14:29,058 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 11:14:29,059 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:14:29,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:14:29,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877271672] [2024-11-09 11:14:29,273 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:14:29,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549602084] [2024-11-09 11:14:29,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549602084] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:14:29,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:14:29,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2024-11-09 11:14:29,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188126608] [2024-11-09 11:14:29,273 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 11:14:29,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 11:14:29,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:14:29,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 11:14:29,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-09 11:14:29,275 INFO L87 Difference]: Start difference. First operand 278 states and 374 transitions. Second operand has 13 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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) [2024-11-09 11:14:29,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:14:29,643 INFO L93 Difference]: Finished difference Result 302 states and 394 transitions. [2024-11-09 11:14:29,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 11:14:29,644 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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 56 [2024-11-09 11:14:29,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:14:29,646 INFO L225 Difference]: With dead ends: 302 [2024-11-09 11:14:29,646 INFO L226 Difference]: Without dead ends: 301 [2024-11-09 11:14:29,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2024-11-09 11:14:29,649 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 65 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:14:29,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 328 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:14:29,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-09 11:14:29,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 278. [2024-11-09 11:14:29,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 214 states have (on average 1.266355140186916) internal successors, (271), 220 states have internal predecessors, (271), 39 states have call successors, (39), 12 states have call predecessors, (39), 15 states have return successors, (63), 45 states have call predecessors, (63), 39 states have call successors, (63) [2024-11-09 11:14:29,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 373 transitions. [2024-11-09 11:14:29,669 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 373 transitions. Word has length 56 [2024-11-09 11:14:29,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:14:29,669 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 373 transitions. [2024-11-09 11:14:29,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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) [2024-11-09 11:14:29,670 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 373 transitions. [2024-11-09 11:14:29,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 11:14:29,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:14:29,671 INFO L215 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] [2024-11-09 11:14:29,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 11:14:29,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:14:29,872 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:14:29,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:14:29,872 INFO L85 PathProgramCache]: Analyzing trace with hash 515976557, now seen corresponding path program 1 times [2024-11-09 11:14:29,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:14:29,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993641794] [2024-11-09 11:14:29,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:29,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:14:29,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:29,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:14:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:29,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 11:14:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:29,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:14:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:29,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:14:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:29,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 11:14:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:29,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 11:14:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:29,991 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-09 11:14:29,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:14:29,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993641794] [2024-11-09 11:14:29,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993641794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:14:29,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:14:29,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 11:14:29,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860272095] [2024-11-09 11:14:29,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:14:29,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 11:14:29,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:14:29,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 11:14:29,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:14:29,993 INFO L87 Difference]: Start difference. First operand 278 states and 373 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) [2024-11-09 11:14:30,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:14:30,088 INFO L93 Difference]: Finished difference Result 565 states and 768 transitions. [2024-11-09 11:14:30,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 11:14:30,088 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 [2024-11-09 11:14:30,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:14:30,090 INFO L225 Difference]: With dead ends: 565 [2024-11-09 11:14:30,090 INFO L226 Difference]: Without dead ends: 325 [2024-11-09 11:14:30,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:14:30,092 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 37 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:14:30,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 358 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:14:30,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-11-09 11:14:30,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 318. [2024-11-09 11:14:30,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 245 states have (on average 1.2816326530612245) internal successors, (314), 249 states have internal predecessors, (314), 45 states have call successors, (45), 15 states have call predecessors, (45), 18 states have return successors, (71), 53 states have call predecessors, (71), 45 states have call successors, (71) [2024-11-09 11:14:30,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 430 transitions. [2024-11-09 11:14:30,106 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 430 transitions. Word has length 64 [2024-11-09 11:14:30,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:14:30,107 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 430 transitions. [2024-11-09 11:14:30,107 INFO L472 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) [2024-11-09 11:14:30,107 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 430 transitions. [2024-11-09 11:14:30,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 11:14:30,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:14:30,108 INFO L215 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] [2024-11-09 11:14:30,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 11:14:30,108 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting binomialCoefficientErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:14:30,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:14:30,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1931668771, now seen corresponding path program 1 times [2024-11-09 11:14:30,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:14:30,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287945211] [2024-11-09 11:14:30,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:30,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:14:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:30,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:14:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:30,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 11:14:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:30,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:14:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:30,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:14:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:30,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 11:14:30,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:30,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 11:14:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:30,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 11:14:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:30,221 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-09 11:14:30,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:14:30,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287945211] [2024-11-09 11:14:30,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287945211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:14:30,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:14:30,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 11:14:30,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400108912] [2024-11-09 11:14:30,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:14:30,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 11:14:30,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:14:30,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 11:14:30,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:14:30,225 INFO L87 Difference]: Start difference. First operand 318 states and 430 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) [2024-11-09 11:14:30,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:14:30,349 INFO L93 Difference]: Finished difference Result 324 states and 430 transitions. [2024-11-09 11:14:30,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 11:14:30,350 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 [2024-11-09 11:14:30,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:14:30,352 INFO L225 Difference]: With dead ends: 324 [2024-11-09 11:14:30,352 INFO L226 Difference]: Without dead ends: 323 [2024-11-09 11:14:30,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-09 11:14:30,353 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 42 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:14:30,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 384 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:14:30,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-09 11:14:30,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 317. [2024-11-09 11:14:30,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 245 states have (on average 1.2448979591836735) internal successors, (305), 248 states have internal predecessors, (305), 45 states have call successors, (45), 15 states have call predecessors, (45), 18 states have return successors, (71), 53 states have call predecessors, (71), 45 states have call successors, (71) [2024-11-09 11:14:30,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 421 transitions. [2024-11-09 11:14:30,371 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 421 transitions. Word has length 66 [2024-11-09 11:14:30,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:14:30,371 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 421 transitions. [2024-11-09 11:14:30,371 INFO L472 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) [2024-11-09 11:14:30,371 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 421 transitions. [2024-11-09 11:14:30,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 11:14:30,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:14:30,372 INFO L215 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] [2024-11-09 11:14:30,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 11:14:30,373 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting binomialCoefficientErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:14:30,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:14:30,373 INFO L85 PathProgramCache]: Analyzing trace with hash -247810189, now seen corresponding path program 1 times [2024-11-09 11:14:30,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:14:30,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668715015] [2024-11-09 11:14:30,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:30,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:14:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:30,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:14:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:30,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 11:14:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:30,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:14:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:30,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:14:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:30,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 11:14:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:30,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 11:14:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:30,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 11:14:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:30,497 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-09 11:14:30,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:14:30,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668715015] [2024-11-09 11:14:30,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668715015] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:14:30,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083116139] [2024-11-09 11:14:30,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:30,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:14:30,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:14:30,499 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) [2024-11-09 11:14:30,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 11:14:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:30,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 11:14:30,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:14:30,676 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-09 11:14:30,677 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:14:30,821 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-09 11:14:30,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083116139] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:14:30,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:14:30,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2024-11-09 11:14:30,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896734240] [2024-11-09 11:14:30,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:14:30,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 11:14:30,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:14:30,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 11:14:30,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2024-11-09 11:14:30,824 INFO L87 Difference]: Start difference. First operand 317 states and 421 transitions. Second operand has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 16 states have internal predecessors, (67), 10 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-09 11:14:31,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:14:31,081 INFO L93 Difference]: Finished difference Result 412 states and 544 transitions. [2024-11-09 11:14:31,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 11:14:31,082 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 16 states have internal predecessors, (67), 10 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) Word has length 67 [2024-11-09 11:14:31,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:14:31,084 INFO L225 Difference]: With dead ends: 412 [2024-11-09 11:14:31,084 INFO L226 Difference]: Without dead ends: 411 [2024-11-09 11:14:31,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2024-11-09 11:14:31,085 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 141 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:14:31,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 612 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:14:31,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-09 11:14:31,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 392. [2024-11-09 11:14:31,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 302 states have (on average 1.2384105960264902) internal successors, (374), 304 states have internal predecessors, (374), 60 states have call successors, (60), 18 states have call predecessors, (60), 21 states have return successors, (95), 69 states have call predecessors, (95), 60 states have call successors, (95) [2024-11-09 11:14:31,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 529 transitions. [2024-11-09 11:14:31,111 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 529 transitions. Word has length 67 [2024-11-09 11:14:31,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:14:31,112 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 529 transitions. [2024-11-09 11:14:31,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 16 states have internal predecessors, (67), 10 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-09 11:14:31,112 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 529 transitions. [2024-11-09 11:14:31,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-09 11:14:31,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:14:31,113 INFO L215 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] [2024-11-09 11:14:31,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 11:14:31,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-09 11:14:31,314 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:14:31,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:14:31,314 INFO L85 PathProgramCache]: Analyzing trace with hash -713206344, now seen corresponding path program 2 times [2024-11-09 11:14:31,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:14:31,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931222918] [2024-11-09 11:14:31,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:31,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:14:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:31,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:14:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:31,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 11:14:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:31,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:14:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:31,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:14:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:31,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 11:14:31,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:31,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 11:14:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:31,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 11:14:31,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:31,459 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-09 11:14:31,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:14:31,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931222918] [2024-11-09 11:14:31,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931222918] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:14:31,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696670947] [2024-11-09 11:14:31,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:14:31,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:14:31,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:14:31,462 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) [2024-11-09 11:14:31,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 11:14:31,524 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:14:31,525 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:14:31,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 11:14:31,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:14:31,695 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-09 11:14:31,696 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:14:31,895 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-09 11:14:31,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696670947] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:14:31,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:14:31,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2024-11-09 11:14:31,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946152042] [2024-11-09 11:14:31,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:14:31,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 11:14:31,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:14:31,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 11:14:31,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2024-11-09 11:14:31,898 INFO L87 Difference]: Start difference. First operand 392 states and 529 transitions. Second operand has 24 states, 23 states have (on average 3.652173913043478) internal successors, (84), 18 states have internal predecessors, (84), 10 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-09 11:14:32,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:14:32,600 INFO L93 Difference]: Finished difference Result 483 states and 617 transitions. [2024-11-09 11:14:32,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-09 11:14:32,600 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.652173913043478) internal successors, (84), 18 states have internal predecessors, (84), 10 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) Word has length 72 [2024-11-09 11:14:32,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:14:32,603 INFO L225 Difference]: With dead ends: 483 [2024-11-09 11:14:32,603 INFO L226 Difference]: Without dead ends: 480 [2024-11-09 11:14:32,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=188, Invalid=1294, Unknown=0, NotChecked=0, Total=1482 [2024-11-09 11:14:32,604 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 251 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 11:14:32,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 752 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 11:14:32,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2024-11-09 11:14:32,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 460. [2024-11-09 11:14:32,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 354 states have (on average 1.231638418079096) internal successors, (436), 360 states have internal predecessors, (436), 66 states have call successors, (66), 24 states have call predecessors, (66), 31 states have return successors, (105), 75 states have call predecessors, (105), 66 states have call successors, (105) [2024-11-09 11:14:32,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 607 transitions. [2024-11-09 11:14:32,630 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 607 transitions. Word has length 72 [2024-11-09 11:14:32,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:14:32,630 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 607 transitions. [2024-11-09 11:14:32,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.652173913043478) internal successors, (84), 18 states have internal predecessors, (84), 10 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-09 11:14:32,631 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 607 transitions. [2024-11-09 11:14:32,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-09 11:14:32,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:14:32,631 INFO L215 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] [2024-11-09 11:14:32,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 11:14:32,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-09 11:14:32,832 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting binomialCoefficientErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:14:32,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:14:32,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1724138098, now seen corresponding path program 1 times [2024-11-09 11:14:32,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:14:32,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055113913] [2024-11-09 11:14:32,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:32,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:14:32,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:32,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:14:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:32,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 11:14:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:32,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:14:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:32,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:14:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:32,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 11:14:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:32,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 11:14:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:32,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 11:14:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:32,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 11:14:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:32,995 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-09 11:14:32,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:14:32,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055113913] [2024-11-09 11:14:32,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055113913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:14:32,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:14:32,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 11:14:32,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799114562] [2024-11-09 11:14:32,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:14:32,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 11:14:32,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:14:32,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 11:14:32,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:14:32,997 INFO L87 Difference]: Start difference. First operand 460 states and 607 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) [2024-11-09 11:14:33,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:14:33,253 INFO L93 Difference]: Finished difference Result 850 states and 1139 transitions. [2024-11-09 11:14:33,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 11:14:33,253 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 [2024-11-09 11:14:33,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:14:33,256 INFO L225 Difference]: With dead ends: 850 [2024-11-09 11:14:33,256 INFO L226 Difference]: Without dead ends: 435 [2024-11-09 11:14:33,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-09 11:14:33,258 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 47 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:14:33,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 338 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:14:33,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-11-09 11:14:33,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 397. [2024-11-09 11:14:33,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 301 states have (on average 1.2524916943521596) internal successors, (377), 314 states have internal predecessors, (377), 58 states have call successors, (58), 24 states have call predecessors, (58), 29 states have return successors, (81), 58 states have call predecessors, (81), 58 states have call successors, (81) [2024-11-09 11:14:33,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 516 transitions. [2024-11-09 11:14:33,280 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 516 transitions. Word has length 76 [2024-11-09 11:14:33,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:14:33,281 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 516 transitions. [2024-11-09 11:14:33,281 INFO L472 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) [2024-11-09 11:14:33,281 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 516 transitions. [2024-11-09 11:14:33,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-09 11:14:33,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:14:33,282 INFO L215 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] [2024-11-09 11:14:33,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 11:14:33,282 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting factErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:14:33,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:14:33,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1228745485, now seen corresponding path program 1 times [2024-11-09 11:14:33,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:14:33,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264762989] [2024-11-09 11:14:33,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:33,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:14:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:14:33,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [278207816] [2024-11-09 11:14:33,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:33,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:14:33,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:14:33,296 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) [2024-11-09 11:14:33,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 11:14:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:33,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 11:14:33,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:14:33,461 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-09 11:14:33,461 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:14:33,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:14:33,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264762989] [2024-11-09 11:14:33,693 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:14:33,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278207816] [2024-11-09 11:14:33,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278207816] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:14:33,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:14:33,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2024-11-09 11:14:33,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322209939] [2024-11-09 11:14:33,694 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 11:14:33,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 11:14:33,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:14:33,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 11:14:33,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-09 11:14:33,695 INFO L87 Difference]: Start difference. First operand 397 states and 516 transitions. Second operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 5 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 11:14:33,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:14:33,942 INFO L93 Difference]: Finished difference Result 404 states and 518 transitions. [2024-11-09 11:14:33,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 11:14:33,943 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 5 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 80 [2024-11-09 11:14:33,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:14:33,945 INFO L225 Difference]: With dead ends: 404 [2024-11-09 11:14:33,945 INFO L226 Difference]: Without dead ends: 403 [2024-11-09 11:14:33,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-09 11:14:33,946 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 35 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:14:33,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 480 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:14:33,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-09 11:14:33,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 397. [2024-11-09 11:14:33,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 301 states have (on average 1.2458471760797343) internal successors, (375), 314 states have internal predecessors, (375), 58 states have call successors, (58), 24 states have call predecessors, (58), 29 states have return successors, (81), 58 states have call predecessors, (81), 58 states have call successors, (81) [2024-11-09 11:14:33,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 514 transitions. [2024-11-09 11:14:33,969 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 514 transitions. Word has length 80 [2024-11-09 11:14:33,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:14:33,970 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 514 transitions. [2024-11-09 11:14:33,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 5 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 11:14:33,970 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 514 transitions. [2024-11-09 11:14:33,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 11:14:33,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:14:33,971 INFO L215 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] [2024-11-09 11:14:33,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-09 11:14:34,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-09 11:14:34,172 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting binomialCoefficientErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:14:34,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:14:34,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1048752312, now seen corresponding path program 1 times [2024-11-09 11:14:34,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:14:34,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394981542] [2024-11-09 11:14:34,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:34,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:14:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:14:34,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1199213071] [2024-11-09 11:14:34,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:34,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:14:34,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:14:34,185 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) [2024-11-09 11:14:34,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 11:14:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:34,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 11:14:34,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:14:34,314 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-09 11:14:34,315 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:14:34,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:14:34,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394981542] [2024-11-09 11:14:34,315 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:14:34,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199213071] [2024-11-09 11:14:34,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199213071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:14:34,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:14:34,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 11:14:34,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359716467] [2024-11-09 11:14:34,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:14:34,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 11:14:34,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:14:34,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 11:14:34,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:14:34,317 INFO L87 Difference]: Start difference. First operand 397 states and 514 transitions. Second operand has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-09 11:14:34,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:14:34,378 INFO L93 Difference]: Finished difference Result 397 states and 514 transitions. [2024-11-09 11:14:34,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 11:14:34,379 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2024-11-09 11:14:34,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:14:34,381 INFO L225 Difference]: With dead ends: 397 [2024-11-09 11:14:34,381 INFO L226 Difference]: Without dead ends: 396 [2024-11-09 11:14:34,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:14:34,382 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:14:34,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 160 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:14:34,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-09 11:14:34,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-11-09 11:14:34,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 301 states have (on average 1.212624584717608) internal successors, (365), 313 states have internal predecessors, (365), 58 states have call successors, (58), 24 states have call predecessors, (58), 29 states have return successors, (81), 58 states have call predecessors, (81), 58 states have call successors, (81) [2024-11-09 11:14:34,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 504 transitions. [2024-11-09 11:14:34,404 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 504 transitions. Word has length 84 [2024-11-09 11:14:34,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:14:34,404 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 504 transitions. [2024-11-09 11:14:34,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-09 11:14:34,405 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 504 transitions. [2024-11-09 11:14:34,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 11:14:34,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:14:34,406 INFO L215 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] [2024-11-09 11:14:34,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-09 11:14:34,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-09 11:14:34,607 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting binomialCoefficientErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:14:34,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:14:34,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1848416756, now seen corresponding path program 1 times [2024-11-09 11:14:34,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:14:34,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648442866] [2024-11-09 11:14:34,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:34,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:14:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:14:34,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1408079505] [2024-11-09 11:14:34,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:34,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:14:34,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:14:34,631 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) [2024-11-09 11:14:34,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 11:14:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:14:34,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 11:14:34,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:14:34,914 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 55 proven. 7 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 11:14:34,914 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:14:35,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:14:35,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648442866] [2024-11-09 11:14:35,507 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:14:35,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408079505] [2024-11-09 11:14:35,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408079505] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:14:35,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:14:35,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2024-11-09 11:14:35,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232882308] [2024-11-09 11:14:35,507 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 11:14:35,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 11:14:35,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:14:35,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 11:14:35,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-11-09 11:14:35,508 INFO L87 Difference]: Start difference. First operand 396 states and 504 transitions. Second operand has 15 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 6 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-09 11:14:35,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:14:35,870 INFO L93 Difference]: Finished difference Result 482 states and 642 transitions. [2024-11-09 11:14:35,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 11:14:35,871 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 6 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 85 [2024-11-09 11:14:35,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:14:35,875 INFO L225 Difference]: With dead ends: 482 [2024-11-09 11:14:35,876 INFO L226 Difference]: Without dead ends: 481 [2024-11-09 11:14:35,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2024-11-09 11:14:35,877 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 74 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 11:14:35,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 376 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 11:14:35,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2024-11-09 11:14:35,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 420. [2024-11-09 11:14:35,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 321 states have (on average 1.1993769470404985) internal successors, (385), 331 states have internal predecessors, (385), 60 states have call successors, (60), 24 states have call predecessors, (60), 31 states have return successors, (90), 64 states have call predecessors, (90), 60 states have call successors, (90) [2024-11-09 11:14:35,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 535 transitions. [2024-11-09 11:14:35,906 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 535 transitions. Word has length 85 [2024-11-09 11:14:35,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:14:35,906 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 535 transitions. [2024-11-09 11:14:35,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 6 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-09 11:14:35,906 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 535 transitions. [2024-11-09 11:14:35,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 11:14:35,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:14:35,907 INFO L215 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] [2024-11-09 11:14:35,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-09 11:14:36,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:14:36,108 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting binomialCoefficientErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:14:36,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:14:36,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1466344650, now seen corresponding path program 2 times [2024-11-09 11:14:36,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:14:36,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420726487] [2024-11-09 11:14:36,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:14:36,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:14:36,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:14:36,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1371559155] [2024-11-09 11:14:36,130 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:14:36,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:14:36,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:14:36,132 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) [2024-11-09 11:14:36,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 11:14:36,198 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:14:36,198 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:14:36,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 11:14:36,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:14:36,439 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 54 proven. 7 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-09 11:14:36,439 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:15:00,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:15:00,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420726487] [2024-11-09 11:15:00,053 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:15:00,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371559155] [2024-11-09 11:15:00,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371559155] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:15:00,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:15:00,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2024-11-09 11:15:00,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567818800] [2024-11-09 11:15:00,053 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 11:15:00,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 11:15:00,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:15:00,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 11:15:00,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=318, Unknown=12, NotChecked=0, Total=380 [2024-11-09 11:15:00,054 INFO L87 Difference]: Start difference. First operand 420 states and 535 transitions. Second operand has 15 states, 13 states have (on average 4.0) internal successors, (52), 14 states have internal predecessors, (52), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-09 11:15:01,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:15:01,673 INFO L93 Difference]: Finished difference Result 470 states and 616 transitions. [2024-11-09 11:15:01,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 11:15:01,674 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 14 states have internal predecessors, (52), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 86 [2024-11-09 11:15:01,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:15:01,677 INFO L225 Difference]: With dead ends: 470 [2024-11-09 11:15:01,677 INFO L226 Difference]: Without dead ends: 469 [2024-11-09 11:15:01,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 23.9s TimeCoverageRelationStatistics Valid=81, Invalid=459, Unknown=12, NotChecked=0, Total=552 [2024-11-09 11:15:01,678 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 60 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 11:15:01,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 385 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 11:15:01,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-11-09 11:15:01,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 421. [2024-11-09 11:15:01,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 322 states have (on average 1.1987577639751552) internal successors, (386), 332 states have internal predecessors, (386), 60 states have call successors, (60), 24 states have call predecessors, (60), 31 states have return successors, (90), 64 states have call predecessors, (90), 60 states have call successors, (90) [2024-11-09 11:15:01,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 536 transitions. [2024-11-09 11:15:01,703 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 536 transitions. Word has length 86 [2024-11-09 11:15:01,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:15:01,704 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 536 transitions. [2024-11-09 11:15:01,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 14 states have internal predecessors, (52), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-09 11:15:01,704 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 536 transitions. [2024-11-09 11:15:01,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-09 11:15:01,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:15:01,705 INFO L215 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] [2024-11-09 11:15:01,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-09 11:15:01,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-11-09 11:15:01,905 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting binomialCoefficientErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:15:01,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:15:01,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1787956042, now seen corresponding path program 1 times [2024-11-09 11:15:01,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:15:01,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257964214] [2024-11-09 11:15:01,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:15:01,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:15:01,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:15:01,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [188977064] [2024-11-09 11:15:01,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:15:01,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:15:01,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:15:01,925 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) [2024-11-09 11:15:01,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 11:15:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:01,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-09 11:15:01,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:15:03,305 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_fact_#t~ret0_40| Int) (v_fact_~n_144 Int)) (let ((.cse0 (* v_fact_~n_144 |v_fact_#t~ret0_40|))) (and (<= |c_fact_#res| .cse0) (<= .cse0 2147483647)))) is different from true [2024-11-09 11:15:04,978 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 57 proven. 7 refuted. 0 times theorem prover too weak. 63 trivial. 6 not checked. [2024-11-09 11:15:04,978 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:15:11,834 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (< 0 |c_fact_#in~n|))) (and (or (and (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse0 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (< .cse0 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse0) 2147483647) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse0) 0))) (< 2147483647 .cse0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse1 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse1) 2147483649) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse1) 0))) (< 2147483647 .cse1))))) .cse2) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse3 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (< .cse3 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse3) 2147483647) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse3) 0))) (< 2147483647 .cse3) (< (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|) 2147483648)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse5 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse4 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (< 2147483646 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse4)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse5) 2147483647) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse4) 0) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse5) 0)))) (< .cse5 0) (< 2147483647 .cse5)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse7 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse6 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (< 2147483646 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse6)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse7) 2147483649) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse6) 0) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse7) 0)))) (< 2147483647 .cse7)))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse9 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (let ((.cse8 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse9))) (or (< .cse8 2147483648) (= .cse8 2147483648) (< 2147483647 .cse9))))) .cse2) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse10 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|)) (.cse11 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (< 0 (+ .cse10 1)) (< .cse11 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse11) 2147483647) (< 2147483648 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse10)) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse10) 0) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse11) 0))) (< 2147483647 .cse11)))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse12 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse12) 0)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse12) 2147483648) (< 2147483647 .cse12)))) .cse2) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse13 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (< 2147483647 .cse13) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse14 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse14) 0)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse13) 2147483649) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse14)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse13) 0))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse16 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|)) (.cse15 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse15) 0)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse15) 2147483648) (< 2147483648 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse16)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse16) 0))) (< 0 (+ .cse16 1)) (< 2147483647 .cse15)))) (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_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse18 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse17) 2147483647) (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse18) 0)) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse18)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse17) 0)))) (< .cse17 0) (< 2147483647 .cse17)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse20 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|)) (.cse19 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse19) 2147483648) (< 2147483648 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse20)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse20) 0))) (< 0 (+ .cse20 1)) (< .cse19 0) (< 2147483647 .cse19)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse21 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse21) 2147483649) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse21) 0))) (< 2147483647 .cse21) (< (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|) 2147483648)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse22 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 0) (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse22) 0)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse22) 2147483648) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))))) (< 2147483647 .cse22)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse24 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|)) (.cse23 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse23) 2147483649) (< 2147483648 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse24)) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse24) 0) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse23) 0))) (< 0 (+ .cse24 1)) (< 2147483647 .cse23)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse26 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|)) (.cse27 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse25 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse27))) (or (< .cse25 2147483648) (< 2147483648 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse26)) (= .cse25 2147483648) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse26) 0)))) (< 0 (+ .cse26 1)) (< 2147483647 .cse27)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse28 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse28) 0)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse28) 2147483648))) (< 2147483647 .cse28) (< (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|) 2147483648)))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse29 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse29) 2147483648) (< .cse29 0) (< 2147483647 .cse29)))) .cse2) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse32 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse31 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|)) (.cse30 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse32))) (or (< .cse30 2147483648) (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse31) 0)) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse31)) (= .cse30 2147483648)))) (< 2147483647 .cse32)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse34 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse33 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse34))) (or (< .cse33 2147483648) (= .cse33 2147483648)))) (< 2147483647 .cse34) (< (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|) 2147483648)))) (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_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse36 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse35) 2147483648) (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse36) 0)) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse36))))) (< .cse35 0) (< 2147483647 .cse35)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse38 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse37 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse38))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 0) (< .cse37 2147483648) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (= .cse37 2147483648)))) (< 2147483647 .cse38)))) (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_#t~ret1_BEFORE_CALL_8| Int)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse39) 2147483648)) (< .cse39 0) (< 2147483647 .cse39) (< (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|) 2147483648)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse41 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse40 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (< 2147483646 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse40)) (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse41) 0)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse41) 2147483648) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse40) 0)))) (< 2147483647 .cse41)))) (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_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse43 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse42) 0)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse42) 2147483648) (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse43) 0)) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse43))))) (< 2147483647 .cse42)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse44 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 0) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse44) 2147483648) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))))) (< .cse44 0) (< 2147483647 .cse44)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse46 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse45 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (< 2147483646 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse45)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse46) 2147483648) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse45) 0)))) (< .cse46 0) (< 2147483647 .cse46)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse49 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| |c_fact_#res|))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse48 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse49)) (.cse47 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (< 2147483646 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse47)) (< .cse48 2147483648) (= .cse48 2147483648) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse47) 0)))) (< 2147483647 .cse49)))))) is different from true [2024-11-09 11:15:19,481 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (< 0 |c_fact_#in~n|))) (and (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse0 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) (.cse1 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (< 2147483647 .cse0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse0) 0) (< 2147483648 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse1)) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse1) 0) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse0) 2147483649))) (< 0 (+ .cse1 1))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse2 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< .cse2 0) (< 2147483647 .cse2) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse3 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (< 2147483646 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse3)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse2) 0) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse3) 0) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse2) 2147483647))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse4 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< .cse4 0) (< 2147483647 .cse4) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse4) 2147483648)) (< (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|) 2147483648)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse6 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|)) (.cse5 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< 2147483647 .cse5) (< 0 (+ .cse6 1)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse7 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse5))) (or (= .cse7 2147483648) (< 2147483648 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse6)) (< .cse7 2147483648) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse6) 0))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse8 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< 2147483647 .cse8) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse8) 0) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse8) 2147483649))) (< (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|) 2147483648)))) (or .cse9 (and (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse10 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< .cse10 0) (< 2147483647 .cse10) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse10) 0) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse10) 2147483647)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse11 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< 2147483647 .cse11) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse11) 0) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse11) 2147483649)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse13 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|)) (.cse12 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< .cse12 0) (< 2147483647 .cse12) (< 0 (+ .cse13 1)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse12) 0) (< 2147483648 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse13)) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse13) 0) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse12) 2147483647)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse14 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< 2147483647 .cse14) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse15 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse14)) (.cse16 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (= .cse15 2147483648) (< 2147483646 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse16)) (< .cse15 2147483648) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse16) 0))))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse18 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (let ((.cse17 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse18))) (or (= .cse17 2147483648) (< 2147483647 .cse18) (< .cse17 2147483648))))) .cse9) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse19 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< 2147483647 .cse19) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse20 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse19))) (or (= .cse20 2147483648) (< .cse20 2147483648)))) (< (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|) 2147483648)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse21 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< 2147483647 .cse21) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse22 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse21) 0) (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse22) 0)) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse22)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse21) 2147483649))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse23 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< .cse23 0) (< 2147483647 .cse23) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse23) 0) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse23) 2147483647))) (< (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|) 2147483648)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse24 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< .cse24 0) (< 2147483647 .cse24) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse25 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse25) 0)) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse25)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse24) 2147483648))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse26 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< 2147483647 .cse26) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse27 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse26) 0)) (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse27) 0)) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse27)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse26) 2147483648))))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse28 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< .cse28 0) (< 2147483647 .cse28) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse28) 2147483648)))) .cse9) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse29 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< 2147483647 .cse29) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse30 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse29))) (or (= .cse30 2147483648) (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 0) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (< .cse30 2147483648))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse31 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< 2147483647 .cse31) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse31) 0)) (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 0) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse31) 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse32 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< 2147483647 .cse32) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse34 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|)) (.cse33 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse32))) (or (= .cse33 2147483648) (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse34) 0)) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse34)) (< .cse33 2147483648))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse35 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< .cse35 0) (< 2147483647 .cse35) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse36 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (< 2147483646 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse36)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse35) 2147483648) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse36) 0))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse37 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< .cse37 0) (< 2147483647 .cse37) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 0) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse37) 2147483648)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse38 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) (.cse39 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (< 2147483647 .cse38) (< 0 (+ .cse39 1)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse38) 0)) (< 2147483648 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse39)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse38) 2147483648) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse39) 0)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse40 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< 2147483647 .cse40) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse40) 0)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse40) 2147483648))) (< (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|) 2147483648)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse41 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) (.cse42 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (< .cse41 0) (< 2147483647 .cse41) (< 0 (+ .cse42 1)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (< 2147483648 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse42)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse41) 2147483648) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse42) 0)))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse43 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse43) 0)) (< 2147483647 .cse43) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse43) 2147483648)))) .cse9) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse44 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< 2147483647 .cse44) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse45 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse44) 0)) (< 2147483646 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse45)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse44) 2147483648) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse45) 0))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse46 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< .cse46 0) (< 2147483647 .cse46) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse47 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse46) 0) (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse47) 0)) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse47)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse46) 2147483647))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse48 (* |c_fact_#t~ret0| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< 2147483647 .cse48) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse49 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (< 2147483646 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse49)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse48) 0) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse49) 0) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse48) 2147483649))))))))) is different from true [2024-11-09 11:15:28,937 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (< 0 |c_fact_#in~n|))) (and (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse1 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (let ((.cse0 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse1))) (or (< .cse0 2147483648) (= .cse0 2147483648) (< 2147483647 .cse1))))) .cse2) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse3 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|)) (.cse4 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< 0 (+ .cse3 1)) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (< 2147483648 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse3)) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse4) 0) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse4) 2147483647) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse3) 0))) (< 2147483647 .cse4) (< .cse4 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse5 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse5) 2147483649) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse5) 0))) (< 2147483647 .cse5) (< (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|) 2147483648)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse7 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) (.cse6 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (< 0 (+ .cse6 1)) (< 2147483647 .cse7) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (< 2147483648 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse6)) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse7) 2147483649) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse7) 0) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse6) 0)))))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse8 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse8) 2147483648) (< 2147483647 .cse8) (< .cse8 0)))) .cse2) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse9 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse9) 2147483648)) (< 2147483647 .cse9) (< .cse9 0) (< (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|) 2147483648)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse10 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 0) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse10) 2147483648) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))))) (< 2147483647 .cse10) (< .cse10 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse11 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< 2147483647 .cse11) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 0) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse11) 2147483648) (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse11) 0)) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse12 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< 2147483647 .cse12) (< .cse12 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse13 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse13) 0)) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse13)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse12) 0) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse12) 2147483647))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse14 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< 2147483647 .cse14) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse16 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse14)) (.cse15 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (< 2147483646 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse15)) (< .cse16 2147483648) (= .cse16 2147483648) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse15) 0))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse18 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse17 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (< 2147483646 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse17)) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse18) 0) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse18) 2147483647) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse17) 0)))) (< 2147483647 .cse18) (< .cse18 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse19 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< 2147483647 .cse19) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse19) 2147483648) (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse19) 0)))) (< (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|) 2147483648)))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int) (|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse20 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse20) 2147483648) (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse20) 0)) (< 2147483647 .cse20)))) .cse2) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse23 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse21 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse23)) (.cse22 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (< .cse21 2147483648) (= .cse21 2147483648) (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse22) 0)) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse22))))) (< 2147483647 .cse23)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse25 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|)) (.cse24 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse24) 2147483648) (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse24) 0)) (< 2147483648 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse25)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse25) 0))) (< 0 (+ .cse25 1)) (< 2147483647 .cse24)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse26 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse27 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse26) 2147483648) (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse27) 0)) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse27))))) (< 2147483647 .cse26) (< .cse26 0)))) (or (and (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse28 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse28) 2147483649) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse28) 0))) (< 2147483647 .cse28)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse29 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse29) 0) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse29) 2147483647))) (< 2147483647 .cse29) (< .cse29 0))))) .cse2) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse31 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse30 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse30) 0)) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse31) 2147483649) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse30)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse31) 0)))) (< 2147483647 .cse31)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse32 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< 2147483647 .cse32) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse33 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse32))) (or (< .cse33 2147483648) (= .cse33 2147483648)))) (< (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|) 2147483648)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse34 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< 2147483647 .cse34) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse35 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse34) 2147483648) (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse35) 0)) (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse34) 0)) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse35)))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse37 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|)) (.cse38 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse36 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse38))) (or (< .cse36 2147483648) (= .cse36 2147483648) (< 2147483648 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse37)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse37) 0)))) (< 0 (+ .cse37 1)) (< 2147483647 .cse38)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse39 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< 2147483647 .cse39) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse40 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (< 2147483646 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse40)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse39) 2147483648) (not (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse39) 0)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse40) 0))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse42 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse41 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (< 2147483646 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse41)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse42) 2147483648) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse41) 0)))) (< 2147483647 .cse42) (< .cse42 0)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse44 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n)) (.cse43 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (< 0 (+ .cse43 1)) (< 2147483647 .cse44) (< .cse44 0) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse44) 2147483648) (< 2147483648 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse43)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse43) 0)))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse46 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse45 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse46))) (or (< |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 0) (< .cse45 2147483648) (= .cse45 2147483648) (< 2147483647 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|)))))) (< 2147483647 .cse46)))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse47 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (< 2147483647 .cse47) (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (let ((.cse48 (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|))) (or (< 2147483646 (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse48)) (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse47) 2147483649) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse47) 0) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse48) 0))))))) (forall ((|v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| Int)) (let ((.cse49 (* |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9| c_fact_~n))) (or (forall ((|v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| Int)) (or (< 0 (+ |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| 1)) (= (mod |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse49) 0) (< (div |v_binomialCoefficient_#t~ret1_BEFORE_CALL_8| .cse49) 2147483647))) (< 2147483647 .cse49) (< .cse49 0) (< (* |c_fact_#in~n| |v_binomialCoefficient_#t~ret2_BEFORE_CALL_9|) 2147483648)))))) is different from true [2024-11-09 11:15:28,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:15:28,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257964214] [2024-11-09 11:15:28,946 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:15:28,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188977064] [2024-11-09 11:15:28,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188977064] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:15:28,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:15:28,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2024-11-09 11:15:28,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644898700] [2024-11-09 11:15:28,947 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 11:15:28,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 11:15:28,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:15:28,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 11:15:28,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=296, Unknown=5, NotChecked=148, Total=506 [2024-11-09 11:15:28,949 INFO L87 Difference]: Start difference. First operand 421 states and 536 transitions. Second operand has 17 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 7 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-09 11:15:30,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:15:35,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:15:39,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.78s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:15:40,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-09 11:15:41,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:15:41,016 INFO L93 Difference]: Finished difference Result 489 states and 641 transitions. [2024-11-09 11:15:41,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 11:15:41,016 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 7 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 87 [2024-11-09 11:15:41,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:15:41,019 INFO L225 Difference]: With dead ends: 489 [2024-11-09 11:15:41,020 INFO L226 Difference]: Without dead ends: 488 [2024-11-09 11:15:41,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=102, Invalid=506, Unknown=8, NotChecked=196, Total=812 [2024-11-09 11:15:41,022 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 40 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 7 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 170 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:15:41,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 550 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 551 Invalid, 4 Unknown, 170 Unchecked, 8.1s Time] [2024-11-09 11:15:41,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-11-09 11:15:41,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 422. [2024-11-09 11:15:41,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 323 states have (on average 1.1981424148606812) internal successors, (387), 333 states have internal predecessors, (387), 60 states have call successors, (60), 24 states have call predecessors, (60), 31 states have return successors, (90), 64 states have call predecessors, (90), 60 states have call successors, (90) [2024-11-09 11:15:41,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 537 transitions. [2024-11-09 11:15:41,061 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 537 transitions. Word has length 87 [2024-11-09 11:15:41,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:15:41,063 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 537 transitions. [2024-11-09 11:15:41,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 7 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-09 11:15:41,063 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 537 transitions. [2024-11-09 11:15:41,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 11:15:41,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:15:41,064 INFO L215 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:15:41,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-09 11:15:41,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:15:41,265 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:15:41,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:15:41,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1836504605, now seen corresponding path program 1 times [2024-11-09 11:15:41,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:15:41,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150003339] [2024-11-09 11:15:41,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:15:41,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:15:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:41,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:15:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:41,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 11:15:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:41,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:15:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:41,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:15:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:41,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 11:15:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:41,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 11:15:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:41,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 11:15:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:41,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 11:15:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:41,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 11:15:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:41,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 11:15:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:41,388 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2024-11-09 11:15:41,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:15:41,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150003339] [2024-11-09 11:15:41,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150003339] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:15:41,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885268561] [2024-11-09 11:15:41,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:15:41,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:15:41,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:15:41,390 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) [2024-11-09 11:15:41,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-09 11:15:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:41,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:15:41,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:15:41,482 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2024-11-09 11:15:41,482 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:15:41,619 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2024-11-09 11:15:41,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885268561] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:15:41,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:15:41,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-09 11:15:41,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624341851] [2024-11-09 11:15:41,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:15:41,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 11:15:41,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:15:41,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 11:15:41,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:15:41,621 INFO L87 Difference]: Start difference. First operand 422 states and 537 transitions. Second operand has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 5 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-09 11:15:41,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:15:41,718 INFO L93 Difference]: Finished difference Result 498 states and 645 transitions. [2024-11-09 11:15:41,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 11:15:41,719 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 5 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 93 [2024-11-09 11:15:41,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:15:41,722 INFO L225 Difference]: With dead ends: 498 [2024-11-09 11:15:41,722 INFO L226 Difference]: Without dead ends: 497 [2024-11-09 11:15:41,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:15:41,723 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 8 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:15:41,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 407 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:15:41,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-11-09 11:15:41,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2024-11-09 11:15:41,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 387 states have (on average 1.1912144702842378) internal successors, (461), 396 states have internal predecessors, (461), 71 states have call successors, (71), 24 states have call predecessors, (71), 31 states have return successors, (101), 76 states have call predecessors, (101), 71 states have call successors, (101) [2024-11-09 11:15:41,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 633 transitions. [2024-11-09 11:15:41,753 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 633 transitions. Word has length 93 [2024-11-09 11:15:41,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:15:41,753 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 633 transitions. [2024-11-09 11:15:41,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 5 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-09 11:15:41,754 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 633 transitions. [2024-11-09 11:15:41,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 11:15:41,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:15:41,755 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:15:41,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-09 11:15:41,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:15:41,955 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting binomialCoefficientErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:15:41,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:15:41,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2070956556, now seen corresponding path program 2 times [2024-11-09 11:15:41,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:15:41,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470800034] [2024-11-09 11:15:41,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:15:41,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:15:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:42,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:15:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:42,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 11:15:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:42,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:15:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:42,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:15:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:42,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 11:15:42,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:42,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 11:15:42,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:42,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 11:15:42,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:42,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 11:15:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:42,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 11:15:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:42,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 11:15:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:42,242 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 71 proven. 4 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 11:15:42,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:15:42,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470800034] [2024-11-09 11:15:42,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470800034] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:15:42,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355000928] [2024-11-09 11:15:42,243 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:15:42,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:15:42,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:15:42,245 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) [2024-11-09 11:15:42,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-09 11:15:42,306 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:15:42,306 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:15:42,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 11:15:42,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:15:42,543 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 68 proven. 7 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 11:15:42,544 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:15:42,873 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 68 proven. 8 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-09 11:15:42,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355000928] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:15:42,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:15:42,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 21 [2024-11-09 11:15:42,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137128006] [2024-11-09 11:15:42,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:15:42,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 11:15:42,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:15:42,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 11:15:42,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2024-11-09 11:15:42,875 INFO L87 Difference]: Start difference. First operand 497 states and 633 transitions. Second operand has 21 states, 21 states have (on average 4.238095238095238) internal successors, (89), 19 states have internal predecessors, (89), 12 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 10 states have call predecessors, (17), 10 states have call successors, (17) [2024-11-09 11:15:43,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:15:43,397 INFO L93 Difference]: Finished difference Result 994 states and 1294 transitions. [2024-11-09 11:15:43,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 11:15:43,397 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.238095238095238) internal successors, (89), 19 states have internal predecessors, (89), 12 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 10 states have call predecessors, (17), 10 states have call successors, (17) Word has length 95 [2024-11-09 11:15:43,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:15:43,400 INFO L225 Difference]: With dead ends: 994 [2024-11-09 11:15:43,401 INFO L226 Difference]: Without dead ends: 519 [2024-11-09 11:15:43,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 194 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2024-11-09 11:15:43,403 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 60 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 11:15:43,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 671 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 11:15:43,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2024-11-09 11:15:43,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 484. [2024-11-09 11:15:43,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 376 states have (on average 1.1861702127659575) internal successors, (446), 385 states have internal predecessors, (446), 70 states have call successors, (70), 24 states have call predecessors, (70), 30 states have return successors, (95), 74 states have call predecessors, (95), 70 states have call successors, (95) [2024-11-09 11:15:43,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 611 transitions. [2024-11-09 11:15:43,430 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 611 transitions. Word has length 95 [2024-11-09 11:15:43,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:15:43,430 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 611 transitions. [2024-11-09 11:15:43,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.238095238095238) internal successors, (89), 19 states have internal predecessors, (89), 12 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 10 states have call predecessors, (17), 10 states have call successors, (17) [2024-11-09 11:15:43,431 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 611 transitions. [2024-11-09 11:15:43,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 11:15:43,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:15:43,432 INFO L215 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, 1] [2024-11-09 11:15:43,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-09 11:15:43,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-09 11:15:43,632 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:15:43,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:15:43,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1099049156, now seen corresponding path program 1 times [2024-11-09 11:15:43,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:15:43,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563849388] [2024-11-09 11:15:43,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:15:43,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:15:43,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:43,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:15:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:43,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 11:15:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:43,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:15:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:43,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:15:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:43,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 11:15:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:43,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 11:15:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:43,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 11:15:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:43,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 11:15:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:43,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 11:15:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:43,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 11:15:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:43,809 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-11-09 11:15:43,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:15:43,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563849388] [2024-11-09 11:15:43,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563849388] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:15:43,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321938599] [2024-11-09 11:15:43,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:15:43,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:15:43,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:15:43,811 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) [2024-11-09 11:15:43,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-09 11:15:43,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:43,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 11:15:43,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:15:43,937 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-11-09 11:15:43,938 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:15:44,186 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-11-09 11:15:44,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321938599] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:15:44,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:15:44,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-09 11:15:44,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911265538] [2024-11-09 11:15:44,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:15:44,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 11:15:44,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:15:44,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 11:15:44,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-09 11:15:44,189 INFO L87 Difference]: Start difference. First operand 484 states and 611 transitions. Second operand has 16 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 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) [2024-11-09 11:15:44,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:15:44,666 INFO L93 Difference]: Finished difference Result 726 states and 916 transitions. [2024-11-09 11:15:44,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 11:15:44,666 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 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 108 [2024-11-09 11:15:44,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:15:44,671 INFO L225 Difference]: With dead ends: 726 [2024-11-09 11:15:44,671 INFO L226 Difference]: Without dead ends: 716 [2024-11-09 11:15:44,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2024-11-09 11:15:44,672 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 116 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 11:15:44,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 480 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 11:15:44,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2024-11-09 11:15:44,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 629. [2024-11-09 11:15:44,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 493 states have (on average 1.1987829614604462) internal successors, (591), 499 states have internal predecessors, (591), 91 states have call successors, (91), 31 states have call predecessors, (91), 37 states have return successors, (118), 98 states have call predecessors, (118), 91 states have call successors, (118) [2024-11-09 11:15:44,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 800 transitions. [2024-11-09 11:15:44,716 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 800 transitions. Word has length 108 [2024-11-09 11:15:44,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:15:44,717 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 800 transitions. [2024-11-09 11:15:44,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 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) [2024-11-09 11:15:44,717 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 800 transitions. [2024-11-09 11:15:44,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 11:15:44,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:15:44,718 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:15:44,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-09 11:15:44,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:15:44,919 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting factErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:15:44,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:15:44,919 INFO L85 PathProgramCache]: Analyzing trace with hash -725323059, now seen corresponding path program 1 times [2024-11-09 11:15:44,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:15:44,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697039818] [2024-11-09 11:15:44,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:15:44,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:15:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:45,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:15:45,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:45,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 11:15:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:45,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:15:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:45,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:15:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:45,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 11:15:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:45,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 11:15:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:45,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 11:15:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:45,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 11:15:45,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:45,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 11:15:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:45,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 11:15:45,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:45,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-09 11:15:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:45,174 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 66 proven. 2 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-11-09 11:15:45,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:15:45,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697039818] [2024-11-09 11:15:45,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697039818] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:15:45,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690442175] [2024-11-09 11:15:45,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:15:45,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:15:45,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:15:45,177 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) [2024-11-09 11:15:45,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-09 11:15:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:45,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 11:15:45,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:15:45,315 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 66 proven. 2 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-11-09 11:15:45,315 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:15:45,583 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 66 proven. 2 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-11-09 11:15:45,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690442175] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:15:45,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:15:45,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 15 [2024-11-09 11:15:45,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120332956] [2024-11-09 11:15:45,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:15:45,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 11:15:45,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:15:45,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 11:15:45,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-09 11:15:45,585 INFO L87 Difference]: Start difference. First operand 629 states and 800 transitions. Second operand has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 13 states have internal predecessors, (54), 6 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-09 11:15:46,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:15:46,033 INFO L93 Difference]: Finished difference Result 1197 states and 1551 transitions. [2024-11-09 11:15:46,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 11:15:46,034 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 13 states have internal predecessors, (54), 6 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 110 [2024-11-09 11:15:46,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:15:46,037 INFO L225 Difference]: With dead ends: 1197 [2024-11-09 11:15:46,037 INFO L226 Difference]: Without dead ends: 638 [2024-11-09 11:15:46,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 230 SyntacticMatches, 10 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-11-09 11:15:46,040 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 51 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 11:15:46,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 496 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 11:15:46,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-11-09 11:15:46,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 631. [2024-11-09 11:15:46,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 494 states have (on average 1.1983805668016194) internal successors, (592), 501 states have internal predecessors, (592), 91 states have call successors, (91), 31 states have call predecessors, (91), 38 states have return successors, (123), 98 states have call predecessors, (123), 91 states have call successors, (123) [2024-11-09 11:15:46,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 806 transitions. [2024-11-09 11:15:46,085 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 806 transitions. Word has length 110 [2024-11-09 11:15:46,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:15:46,085 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 806 transitions. [2024-11-09 11:15:46,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 13 states have internal predecessors, (54), 6 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-09 11:15:46,086 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 806 transitions. [2024-11-09 11:15:46,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 11:15:46,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:15:46,088 INFO L215 NwaCegarLoop]: trace histogram [11, 9, 7, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:15:46,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-09 11:15:46,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:15:46,289 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting factErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:15:46,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:15:46,289 INFO L85 PathProgramCache]: Analyzing trace with hash 217058850, now seen corresponding path program 2 times [2024-11-09 11:15:46,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:15:46,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213923784] [2024-11-09 11:15:46,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:15:46,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:15:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:15:46,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1340482521] [2024-11-09 11:15:46,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:15:46,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:15:46,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:15:46,307 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) [2024-11-09 11:15:46,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-09 11:15:46,387 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:15:46,388 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:15:46,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 11:15:46,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:15:46,586 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 75 proven. 14 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-11-09 11:15:46,586 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:15:46,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:15:46,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213923784] [2024-11-09 11:15:46,786 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:15:46,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340482521] [2024-11-09 11:15:46,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340482521] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:15:46,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:15:46,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2024-11-09 11:15:46,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895619812] [2024-11-09 11:15:46,786 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 11:15:46,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 11:15:46,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:15:46,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 11:15:46,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2024-11-09 11:15:46,787 INFO L87 Difference]: Start difference. First operand 631 states and 806 transitions. Second operand has 17 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 7 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-09 11:15:47,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:15:47,399 INFO L93 Difference]: Finished difference Result 752 states and 953 transitions. [2024-11-09 11:15:47,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 11:15:47,399 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 7 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 115 [2024-11-09 11:15:47,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:15:47,402 INFO L225 Difference]: With dead ends: 752 [2024-11-09 11:15:47,402 INFO L226 Difference]: Without dead ends: 751 [2024-11-09 11:15:47,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2024-11-09 11:15:47,404 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 84 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 11:15:47,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 429 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 11:15:47,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2024-11-09 11:15:47,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 730. [2024-11-09 11:15:47,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 569 states have (on average 1.2003514938488578) internal successors, (683), 576 states have internal predecessors, (683), 107 states have call successors, (107), 38 states have call predecessors, (107), 46 states have return successors, (143), 115 states have call predecessors, (143), 107 states have call successors, (143) [2024-11-09 11:15:47,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 933 transitions. [2024-11-09 11:15:47,446 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 933 transitions. Word has length 115 [2024-11-09 11:15:47,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:15:47,446 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 933 transitions. [2024-11-09 11:15:47,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 7 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-09 11:15:47,447 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 933 transitions. [2024-11-09 11:15:47,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 11:15:47,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:15:47,449 INFO L215 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, 1] [2024-11-09 11:15:47,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-09 11:15:47,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:15:47,653 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:15:47,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:15:47,653 INFO L85 PathProgramCache]: Analyzing trace with hash -459868787, now seen corresponding path program 2 times [2024-11-09 11:15:47,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:15:47,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100261491] [2024-11-09 11:15:47,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:15:47,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:15:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:47,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:15:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:47,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 11:15:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:47,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:15:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:47,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:15:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:47,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 11:15:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:47,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 11:15:47,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:47,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 11:15:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:47,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 11:15:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:47,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 11:15:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:47,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 11:15:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:47,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-09 11:15:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:47,782 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-09 11:15:47,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:15:47,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100261491] [2024-11-09 11:15:47,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100261491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:15:47,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:15:47,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 11:15:47,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105077977] [2024-11-09 11:15:47,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:15:47,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:15:47,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:15:47,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:15:47,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:15:47,785 INFO L87 Difference]: Start difference. First operand 730 states and 933 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-09 11:15:47,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:15:47,887 INFO L93 Difference]: Finished difference Result 1125 states and 1432 transitions. [2024-11-09 11:15:47,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:15:47,888 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 114 [2024-11-09 11:15:47,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:15:47,892 INFO L225 Difference]: With dead ends: 1125 [2024-11-09 11:15:47,892 INFO L226 Difference]: Without dead ends: 669 [2024-11-09 11:15:47,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:15:47,895 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 16 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:15:47,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 217 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:15:47,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2024-11-09 11:15:47,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 668. [2024-11-09 11:15:47,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 523 states have (on average 1.1854684512428297) internal successors, (620), 528 states have internal predecessors, (620), 95 states have call successors, (95), 35 states have call predecessors, (95), 42 states have return successors, (127), 104 states have call predecessors, (127), 95 states have call successors, (127) [2024-11-09 11:15:47,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 842 transitions. [2024-11-09 11:15:47,931 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 842 transitions. Word has length 114 [2024-11-09 11:15:47,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:15:47,931 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 842 transitions. [2024-11-09 11:15:47,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-09 11:15:47,931 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 842 transitions. [2024-11-09 11:15:47,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 11:15:47,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:15:47,933 INFO L215 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, 1] [2024-11-09 11:15:47,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-09 11:15:47,934 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting factErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [factErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, factErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:15:47,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:15:47,934 INFO L85 PathProgramCache]: Analyzing trace with hash -873188839, now seen corresponding path program 1 times [2024-11-09 11:15:47,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:15:47,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848474663] [2024-11-09 11:15:47,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:15:47,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:15:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:15:47,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1087483368] [2024-11-09 11:15:47,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:15:47,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:15:47,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:15:47,950 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) [2024-11-09 11:15:47,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-09 11:15:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:15:48,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 11:15:48,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:15:48,173 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-11-09 11:15:48,173 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:15:48,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:15:48,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848474663] [2024-11-09 11:15:48,294 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:15:48,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087483368] [2024-11-09 11:15:48,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087483368] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:15:48,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:15:48,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2024-11-09 11:15:48,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288637978] [2024-11-09 11:15:48,294 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 11:15:48,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 11:15:48,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:15:48,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 11:15:48,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-09 11:15:48,295 INFO L87 Difference]: Start difference. First operand 668 states and 842 transitions. Second operand has 11 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7)