./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-zilu/benchmark41_conjunctive.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/loop-zilu/benchmark41_conjunctive.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-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 32bit --witnessprinter.graph.data.programhash e8c2a2f5606e46c1a328e1728dc6cdf6823e5c50ed56fab8310a8cb7bd30fe62 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:47:16,207 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:47:16,268 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:47:16,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:47:16,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:47:16,291 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:47:16,292 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:47:16,292 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:47:16,292 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:47:16,293 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:47:16,293 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:47:16,294 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:47:16,294 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:47:16,294 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:47:16,294 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:47:16,294 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:47:16,294 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:47:16,294 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:47:16,294 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:47:16,295 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:47:16,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:47:16,295 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:47:16,295 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:47:16,295 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:47:16,295 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:47:16,295 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:47:16,295 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:47:16,295 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:47:16,295 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:47:16,295 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:47:16,295 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:47:16,295 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:47:16,295 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:47:16,295 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:47:16,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:47:16,295 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:47:16,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:47:16,295 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:47:16,296 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:47:16,296 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:47:16,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:47:16,296 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:47:16,296 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:47:16,296 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:47:16,296 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:47:16,296 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e8c2a2f5606e46c1a328e1728dc6cdf6823e5c50ed56fab8310a8cb7bd30fe62 [2025-03-04 10:47:16,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:47:16,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:47:16,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:47:16,565 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:47:16,566 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:47:16,568 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-zilu/benchmark41_conjunctive.i [2025-03-04 10:47:17,734 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25c224113/cdbe1c5f6bfb40e9b8863ded4283705f/FLAG8c8f23c1d [2025-03-04 10:47:17,990 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:47:17,990 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark41_conjunctive.i [2025-03-04 10:47:17,998 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25c224113/cdbe1c5f6bfb40e9b8863ded4283705f/FLAG8c8f23c1d [2025-03-04 10:47:18,016 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25c224113/cdbe1c5f6bfb40e9b8863ded4283705f [2025-03-04 10:47:18,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:47:18,019 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:47:18,020 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:47:18,021 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:47:18,025 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:47:18,025 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:47:18" (1/1) ... [2025-03-04 10:47:18,026 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@188475c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:18, skipping insertion in model container [2025-03-04 10:47:18,026 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:47:18" (1/1) ... [2025-03-04 10:47:18,037 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:47:18,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:47:18,165 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:47:18,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:47:18,187 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:47:18,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:18 WrapperNode [2025-03-04 10:47:18,188 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:47:18,188 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:47:18,188 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:47:18,188 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:47:18,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:18" (1/1) ... [2025-03-04 10:47:18,197 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:18" (1/1) ... [2025-03-04 10:47:18,209 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 59 [2025-03-04 10:47:18,210 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:47:18,210 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:47:18,211 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:47:18,211 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:47:18,215 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:18" (1/1) ... [2025-03-04 10:47:18,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:18" (1/1) ... [2025-03-04 10:47:18,216 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:18" (1/1) ... [2025-03-04 10:47:18,226 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 10:47:18,226 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:18" (1/1) ... [2025-03-04 10:47:18,226 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:18" (1/1) ... [2025-03-04 10:47:18,228 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:18" (1/1) ... [2025-03-04 10:47:18,229 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:18" (1/1) ... [2025-03-04 10:47:18,230 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:18" (1/1) ... [2025-03-04 10:47:18,230 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:18" (1/1) ... [2025-03-04 10:47:18,231 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:47:18,232 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:47:18,232 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:47:18,232 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:47:18,233 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:18" (1/1) ... [2025-03-04 10:47:18,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:47:18,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:18,256 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) [2025-03-04 10:47:18,258 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 [2025-03-04 10:47:18,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:47:18,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:47:18,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:47:18,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:47:18,316 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:47:18,317 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:47:18,466 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-04 10:47:18,469 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:47:18,476 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:47:18,476 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:47:18,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:47:18 BoogieIcfgContainer [2025-03-04 10:47:18,477 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:47:18,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:47:18,480 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:47:18,483 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:47:18,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:47:18" (1/3) ... [2025-03-04 10:47:18,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@376e4ee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:47:18, skipping insertion in model container [2025-03-04 10:47:18,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:18" (2/3) ... [2025-03-04 10:47:18,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@376e4ee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:47:18, skipping insertion in model container [2025-03-04 10:47:18,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:47:18" (3/3) ... [2025-03-04 10:47:18,487 INFO L128 eAbstractionObserver]: Analyzing ICFG benchmark41_conjunctive.i [2025-03-04 10:47:18,499 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:47:18,501 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG benchmark41_conjunctive.i that has 1 procedures, 35 locations, 1 initial locations, 1 loop locations, and 10 error locations. [2025-03-04 10:47:18,542 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:47:18,551 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;@73286510, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:47:18,551 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-04 10:47:18,555 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 34 states have internal predecessors, (40), 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) [2025-03-04 10:47:18,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 10:47:18,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:18,559 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:47:18,560 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:47:18,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:18,563 INFO L85 PathProgramCache]: Analyzing trace with hash 2129019736, now seen corresponding path program 1 times [2025-03-04 10:47:18,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:18,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953737736] [2025-03-04 10:47:18,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:18,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:18,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:47:18,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:47:18,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:18,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:18,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:18,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:18,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953737736] [2025-03-04 10:47:18,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953737736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:18,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:18,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:47:18,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657556213] [2025-03-04 10:47:18,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:18,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:47:18,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:18,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:47:18,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:47:18,731 INFO L87 Difference]: Start difference. First operand has 35 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 34 states have internal predecessors, (40), 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) Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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) [2025-03-04 10:47:18,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:18,799 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2025-03-04 10:47:18,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:47:18,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2025-03-04 10:47:18,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:18,805 INFO L225 Difference]: With dead ends: 57 [2025-03-04 10:47:18,805 INFO L226 Difference]: Without dead ends: 26 [2025-03-04 10:47:18,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:47:18,812 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 20 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:18,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 45 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:47:18,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-04 10:47:18,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-04 10:47:18,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 25 states have internal predecessors, (26), 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) [2025-03-04 10:47:18,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2025-03-04 10:47:18,837 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 6 [2025-03-04 10:47:18,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:18,838 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2025-03-04 10:47:18,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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) [2025-03-04 10:47:18,839 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2025-03-04 10:47:18,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 10:47:18,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:18,839 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:18,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:47:18,840 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:47:18,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:18,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1575102374, now seen corresponding path program 1 times [2025-03-04 10:47:18,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:18,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156123901] [2025-03-04 10:47:18,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:18,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:18,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:47:18,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:47:18,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:18,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:18,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:18,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:18,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156123901] [2025-03-04 10:47:18,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156123901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:18,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:18,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:47:18,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454513203] [2025-03-04 10:47:18,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:18,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:47:18,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:18,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:47:18,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:47:18,909 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:47:18,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:18,948 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2025-03-04 10:47:18,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:47:18,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 10:47:18,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:18,950 INFO L225 Difference]: With dead ends: 37 [2025-03-04 10:47:18,950 INFO L226 Difference]: Without dead ends: 36 [2025-03-04 10:47:18,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:47:18,951 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:18,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 41 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:47:18,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-04 10:47:18,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2025-03-04 10:47:18,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 29 states have internal predecessors, (31), 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) [2025-03-04 10:47:18,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2025-03-04 10:47:18,955 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 7 [2025-03-04 10:47:18,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:18,955 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2025-03-04 10:47:18,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:47:18,955 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2025-03-04 10:47:18,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 10:47:18,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:18,956 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:18,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:47:18,956 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:47:18,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:18,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1583492620, now seen corresponding path program 1 times [2025-03-04 10:47:18,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:18,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740809880] [2025-03-04 10:47:18,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:18,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:18,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:47:18,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:47:18,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:18,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:19,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:19,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:19,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740809880] [2025-03-04 10:47:19,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740809880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:19,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:19,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:47:19,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757445185] [2025-03-04 10:47:19,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:19,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:47:19,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:19,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:47:19,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:47:19,071 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:47:19,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:19,129 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2025-03-04 10:47:19,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:47:19,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 10:47:19,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:19,130 INFO L225 Difference]: With dead ends: 36 [2025-03-04 10:47:19,130 INFO L226 Difference]: Without dead ends: 35 [2025-03-04 10:47:19,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:47:19,131 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 16 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:19,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 53 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:47:19,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-04 10:47:19,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2025-03-04 10:47:19,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 28 states have internal predecessors, (30), 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) [2025-03-04 10:47:19,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2025-03-04 10:47:19,135 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 8 [2025-03-04 10:47:19,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:19,135 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2025-03-04 10:47:19,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:47:19,135 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2025-03-04 10:47:19,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 10:47:19,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:19,136 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:19,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:47:19,136 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:47:19,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:19,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1583533334, now seen corresponding path program 1 times [2025-03-04 10:47:19,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:19,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663881523] [2025-03-04 10:47:19,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:19,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:19,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:47:19,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:47:19,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:19,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:19,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:19,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:19,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663881523] [2025-03-04 10:47:19,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663881523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:19,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:19,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:47:19,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396973836] [2025-03-04 10:47:19,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:19,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:47:19,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:19,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:47:19,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:47:19,182 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:47:19,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:19,215 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2025-03-04 10:47:19,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:47:19,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 10:47:19,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:19,217 INFO L225 Difference]: With dead ends: 29 [2025-03-04 10:47:19,217 INFO L226 Difference]: Without dead ends: 28 [2025-03-04 10:47:19,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:47:19,218 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:19,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 26 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:47:19,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-04 10:47:19,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-04 10:47:19,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.380952380952381) internal successors, (29), 27 states have internal predecessors, (29), 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) [2025-03-04 10:47:19,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2025-03-04 10:47:19,220 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 8 [2025-03-04 10:47:19,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:19,222 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2025-03-04 10:47:19,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:47:19,222 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2025-03-04 10:47:19,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 10:47:19,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:19,223 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:19,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:47:19,224 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:47:19,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:19,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1843630947, now seen corresponding path program 1 times [2025-03-04 10:47:19,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:19,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372737543] [2025-03-04 10:47:19,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:19,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:19,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:47:19,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:47:19,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:19,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:19,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:19,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:19,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372737543] [2025-03-04 10:47:19,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372737543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:19,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:19,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:47:19,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396614657] [2025-03-04 10:47:19,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:19,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:47:19,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:19,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:47:19,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:47:19,272 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 4 states, 3 states have (on average 3.0) 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) [2025-03-04 10:47:19,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:19,331 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2025-03-04 10:47:19,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:47:19,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) 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 [2025-03-04 10:47:19,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:19,332 INFO L225 Difference]: With dead ends: 33 [2025-03-04 10:47:19,332 INFO L226 Difference]: Without dead ends: 32 [2025-03-04 10:47:19,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:47:19,333 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 23 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:19,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 30 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:47:19,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-04 10:47:19,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-04 10:47:19,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.32) internal successors, (33), 31 states have internal predecessors, (33), 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) [2025-03-04 10:47:19,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2025-03-04 10:47:19,336 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 9 [2025-03-04 10:47:19,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:19,337 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2025-03-04 10:47:19,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) 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) [2025-03-04 10:47:19,337 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2025-03-04 10:47:19,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 10:47:19,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:19,337 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:19,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:47:19,339 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:47:19,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:19,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1844893092, now seen corresponding path program 1 times [2025-03-04 10:47:19,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:19,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171440378] [2025-03-04 10:47:19,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:19,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:19,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:47:19,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:47:19,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:19,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:19,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:19,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:19,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171440378] [2025-03-04 10:47:19,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171440378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:19,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:19,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:47:19,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062136064] [2025-03-04 10:47:19,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:19,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:47:19,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:19,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:47:19,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:47:19,382 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 4 states, 3 states have (on average 3.0) 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) [2025-03-04 10:47:19,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:19,416 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2025-03-04 10:47:19,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:47:19,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) 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 [2025-03-04 10:47:19,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:19,417 INFO L225 Difference]: With dead ends: 37 [2025-03-04 10:47:19,417 INFO L226 Difference]: Without dead ends: 36 [2025-03-04 10:47:19,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:47:19,417 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:19,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 40 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:47:19,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-04 10:47:19,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2025-03-04 10:47:19,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 33 states have internal predecessors, (35), 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) [2025-03-04 10:47:19,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2025-03-04 10:47:19,423 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 9 [2025-03-04 10:47:19,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:19,423 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2025-03-04 10:47:19,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) 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) [2025-03-04 10:47:19,423 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2025-03-04 10:47:19,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 10:47:19,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:19,423 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:19,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:47:19,423 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:47:19,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:19,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1317984490, now seen corresponding path program 1 times [2025-03-04 10:47:19,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:19,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348702827] [2025-03-04 10:47:19,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:19,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:19,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:47:19,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:47:19,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:19,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:19,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:19,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:19,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348702827] [2025-03-04 10:47:19,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348702827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:19,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:19,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:47:19,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494083152] [2025-03-04 10:47:19,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:19,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:47:19,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:19,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:47:19,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:47:19,493 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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) [2025-03-04 10:47:19,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:19,536 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2025-03-04 10:47:19,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:47:19,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2025-03-04 10:47:19,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:19,537 INFO L225 Difference]: With dead ends: 37 [2025-03-04 10:47:19,537 INFO L226 Difference]: Without dead ends: 36 [2025-03-04 10:47:19,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:47:19,538 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 11 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:19,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 41 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:47:19,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-04 10:47:19,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2025-03-04 10:47:19,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 34 states have internal predecessors, (36), 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) [2025-03-04 10:47:19,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2025-03-04 10:47:19,541 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 10 [2025-03-04 10:47:19,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:19,541 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2025-03-04 10:47:19,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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) [2025-03-04 10:47:19,541 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2025-03-04 10:47:19,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 10:47:19,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:19,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:19,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:47:19,542 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:47:19,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:19,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1357110996, now seen corresponding path program 1 times [2025-03-04 10:47:19,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:19,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549327973] [2025-03-04 10:47:19,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:19,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:19,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:47:19,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:47:19,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:19,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:19,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:19,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:19,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549327973] [2025-03-04 10:47:19,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549327973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:19,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:19,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:47:19,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526733420] [2025-03-04 10:47:19,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:19,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:47:19,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:19,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:47:19,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:47:19,574 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) [2025-03-04 10:47:19,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:19,592 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2025-03-04 10:47:19,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:47:19,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2025-03-04 10:47:19,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:19,594 INFO L225 Difference]: With dead ends: 39 [2025-03-04 10:47:19,594 INFO L226 Difference]: Without dead ends: 38 [2025-03-04 10:47:19,594 INFO L434 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 [2025-03-04 10:47:19,595 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 34 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 [2025-03-04 10:47:19,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 34 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:47:19,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-04 10:47:19,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-03-04 10:47:19,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 35 states have internal predecessors, (37), 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) [2025-03-04 10:47:19,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2025-03-04 10:47:19,598 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 10 [2025-03-04 10:47:19,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:19,598 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2025-03-04 10:47:19,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) [2025-03-04 10:47:19,599 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2025-03-04 10:47:19,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 10:47:19,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:19,599 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:19,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:47:19,599 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:47:19,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:19,599 INFO L85 PathProgramCache]: Analyzing trace with hash -2092153791, now seen corresponding path program 1 times [2025-03-04 10:47:19,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:19,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756255765] [2025-03-04 10:47:19,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:19,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:19,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:47:19,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:47:19,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:19,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:19,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:19,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:19,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756255765] [2025-03-04 10:47:19,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756255765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:19,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:19,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:47:19,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656611946] [2025-03-04 10:47:19,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:19,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:47:19,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:19,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:47:19,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:47:19,632 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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) [2025-03-04 10:47:19,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:19,665 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2025-03-04 10:47:19,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:47:19,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2025-03-04 10:47:19,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:19,666 INFO L225 Difference]: With dead ends: 38 [2025-03-04 10:47:19,666 INFO L226 Difference]: Without dead ends: 31 [2025-03-04 10:47:19,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:47:19,666 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 22 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:19,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 26 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:47:19,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-04 10:47:19,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-04 10:47:19,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 30 states have internal predecessors, (31), 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) [2025-03-04 10:47:19,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2025-03-04 10:47:19,670 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 11 [2025-03-04 10:47:19,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:19,670 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2025-03-04 10:47:19,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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) [2025-03-04 10:47:19,670 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2025-03-04 10:47:19,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 10:47:19,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:19,670 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:19,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:47:19,671 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:47:19,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:19,671 INFO L85 PathProgramCache]: Analyzing trace with hash -879232094, now seen corresponding path program 1 times [2025-03-04 10:47:19,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:19,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555076409] [2025-03-04 10:47:19,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:19,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:19,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:47:19,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:47:19,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:19,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:19,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:19,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:19,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555076409] [2025-03-04 10:47:19,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555076409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:19,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:19,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:47:19,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109915223] [2025-03-04 10:47:19,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:19,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:47:19,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:19,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:47:19,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:47:19,692 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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) [2025-03-04 10:47:19,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:19,702 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2025-03-04 10:47:19,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:47:19,702 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), 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 11 [2025-03-04 10:47:19,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:19,703 INFO L225 Difference]: With dead ends: 31 [2025-03-04 10:47:19,703 INFO L226 Difference]: Without dead ends: 30 [2025-03-04 10:47:19,703 INFO L434 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 [2025-03-04 10:47:19,703 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:19,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 17 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:47:19,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-04 10:47:19,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-04 10:47:19,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.25) internal successors, (30), 29 states have internal predecessors, (30), 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) [2025-03-04 10:47:19,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2025-03-04 10:47:19,706 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 11 [2025-03-04 10:47:19,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:19,706 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2025-03-04 10:47:19,706 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), 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) [2025-03-04 10:47:19,706 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2025-03-04 10:47:19,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 10:47:19,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:19,707 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:19,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:47:19,707 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:47:19,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:19,707 INFO L85 PathProgramCache]: Analyzing trace with hash 34613151, now seen corresponding path program 1 times [2025-03-04 10:47:19,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:19,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676281623] [2025-03-04 10:47:19,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:19,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:19,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:47:19,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:47:19,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:19,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:19,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:19,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:19,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676281623] [2025-03-04 10:47:19,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676281623] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:47:19,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145277363] [2025-03-04 10:47:19,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:19,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:19,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:19,762 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) [2025-03-04 10:47:19,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:47:19,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:47:19,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:47:19,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:19,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:19,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:47:19,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:19,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:19,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:47:19,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:19,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145277363] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:47:19,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:47:19,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 10:47:19,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759258638] [2025-03-04 10:47:19,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:47:19,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:47:19,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:19,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:47:19,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:47:19,887 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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) [2025-03-04 10:47:19,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:19,945 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2025-03-04 10:47:19,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:47:19,945 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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 15 [2025-03-04 10:47:19,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:19,946 INFO L225 Difference]: With dead ends: 74 [2025-03-04 10:47:19,946 INFO L226 Difference]: Without dead ends: 73 [2025-03-04 10:47:19,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:47:19,947 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 46 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:19,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 64 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:47:19,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-04 10:47:19,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2025-03-04 10:47:19,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.288888888888889) internal successors, (58), 50 states have internal predecessors, (58), 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) [2025-03-04 10:47:19,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2025-03-04 10:47:19,955 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 15 [2025-03-04 10:47:19,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:19,955 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2025-03-04 10:47:19,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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) [2025-03-04 10:47:19,955 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2025-03-04 10:47:19,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 10:47:19,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:19,956 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:19,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:47:20,159 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,SelfDestructingSolverStorable10 [2025-03-04 10:47:20,159 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:47:20,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:20,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1097762532, now seen corresponding path program 1 times [2025-03-04 10:47:20,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:20,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015208094] [2025-03-04 10:47:20,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:20,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:20,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:47:20,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:47:20,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:20,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:20,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:20,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:20,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015208094] [2025-03-04 10:47:20,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015208094] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:47:20,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596565596] [2025-03-04 10:47:20,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:20,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:20,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:20,224 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) [2025-03-04 10:47:20,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:47:20,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:47:20,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:47:20,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:20,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:20,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:47:20,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:20,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:20,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:47:20,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:20,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596565596] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:47:20,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:47:20,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-04 10:47:20,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221227381] [2025-03-04 10:47:20,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:47:20,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:47:20,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:20,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:47:20,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:47:20,429 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 14 states have internal predecessors, (47), 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) [2025-03-04 10:47:20,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:20,508 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2025-03-04 10:47:20,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:47:20,509 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 14 states have internal predecessors, (47), 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 17 [2025-03-04 10:47:20,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:20,509 INFO L225 Difference]: With dead ends: 63 [2025-03-04 10:47:20,510 INFO L226 Difference]: Without dead ends: 62 [2025-03-04 10:47:20,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:47:20,511 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:20,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 74 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:47:20,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-04 10:47:20,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2025-03-04 10:47:20,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 54 states have internal predecessors, (62), 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) [2025-03-04 10:47:20,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2025-03-04 10:47:20,516 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 17 [2025-03-04 10:47:20,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:20,517 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2025-03-04 10:47:20,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 14 states have internal predecessors, (47), 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) [2025-03-04 10:47:20,517 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2025-03-04 10:47:20,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 10:47:20,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:20,517 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:20,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:47:20,722 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,SelfDestructingSolverStorable11 [2025-03-04 10:47:20,722 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:47:20,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:20,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1096500387, now seen corresponding path program 1 times [2025-03-04 10:47:20,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:20,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319849667] [2025-03-04 10:47:20,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:20,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:20,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:47:20,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:47:20,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:20,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:20,766 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:20,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:20,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319849667] [2025-03-04 10:47:20,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319849667] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:47:20,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802157157] [2025-03-04 10:47:20,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:20,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:20,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:20,769 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) [2025-03-04 10:47:20,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:47:20,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:47:20,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:47:20,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:20,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:20,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:47:20,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:20,819 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:20,819 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:47:20,862 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:20,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802157157] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:47:20,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:47:20,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 10:47:20,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977075104] [2025-03-04 10:47:20,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:47:20,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:47:20,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:20,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:47:20,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:47:20,864 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 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) [2025-03-04 10:47:20,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:20,918 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2025-03-04 10:47:20,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:47:20,919 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 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 17 [2025-03-04 10:47:20,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:20,919 INFO L225 Difference]: With dead ends: 74 [2025-03-04 10:47:20,919 INFO L226 Difference]: Without dead ends: 73 [2025-03-04 10:47:20,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:47:20,920 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 22 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:20,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 86 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:47:20,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-04 10:47:20,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2025-03-04 10:47:20,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 56 states have internal predecessors, (62), 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) [2025-03-04 10:47:20,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2025-03-04 10:47:20,924 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 17 [2025-03-04 10:47:20,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:20,924 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2025-03-04 10:47:20,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 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) [2025-03-04 10:47:20,925 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2025-03-04 10:47:20,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 10:47:20,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:20,925 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:20,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:47:21,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:21,126 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:47:21,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:21,126 INFO L85 PathProgramCache]: Analyzing trace with hash 329099857, now seen corresponding path program 1 times [2025-03-04 10:47:21,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:21,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017417799] [2025-03-04 10:47:21,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:21,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:21,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:47:21,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:47:21,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:21,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:21,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:21,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:21,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017417799] [2025-03-04 10:47:21,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017417799] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:47:21,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572881685] [2025-03-04 10:47:21,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:21,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:21,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:21,203 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) [2025-03-04 10:47:21,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:47:21,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:47:21,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:47:21,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:21,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:21,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:47:21,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:21,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:21,378 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:47:21,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:47:21,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572881685] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:47:21,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:47:21,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 6] total 16 [2025-03-04 10:47:21,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633580128] [2025-03-04 10:47:21,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:21,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:47:21,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:21,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:47:21,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:47:21,457 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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) [2025-03-04 10:47:21,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:21,501 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2025-03-04 10:47:21,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:47:21,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 18 [2025-03-04 10:47:21,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:21,502 INFO L225 Difference]: With dead ends: 57 [2025-03-04 10:47:21,502 INFO L226 Difference]: Without dead ends: 56 [2025-03-04 10:47:21,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:47:21,503 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:21,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 19 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:47:21,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-04 10:47:21,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-04 10:47:21,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.196078431372549) internal successors, (61), 55 states have internal predecessors, (61), 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) [2025-03-04 10:47:21,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2025-03-04 10:47:21,510 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 18 [2025-03-04 10:47:21,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:21,510 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2025-03-04 10:47:21,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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) [2025-03-04 10:47:21,510 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2025-03-04 10:47:21,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 10:47:21,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:21,511 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:21,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:47:21,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:21,711 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:47:21,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:21,711 INFO L85 PathProgramCache]: Analyzing trace with hash 368226363, now seen corresponding path program 1 times [2025-03-04 10:47:21,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:21,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997238663] [2025-03-04 10:47:21,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:21,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:21,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:47:21,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:47:21,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:21,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:21,736 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:21,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:21,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997238663] [2025-03-04 10:47:21,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997238663] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:47:21,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320001916] [2025-03-04 10:47:21,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:21,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:21,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:21,738 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) [2025-03-04 10:47:21,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:47:21,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:47:21,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:47:21,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:21,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:21,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:47:21,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:21,789 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:21,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:47:21,818 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:21,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320001916] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:47:21,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:47:21,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-04 10:47:21,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622821820] [2025-03-04 10:47:21,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:47:21,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:47:21,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:21,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:47:21,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:47:21,819 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 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) [2025-03-04 10:47:21,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:21,841 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2025-03-04 10:47:21,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:47:21,842 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 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 18 [2025-03-04 10:47:21,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:21,842 INFO L225 Difference]: With dead ends: 73 [2025-03-04 10:47:21,842 INFO L226 Difference]: Without dead ends: 72 [2025-03-04 10:47:21,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:47:21,843 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 33 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:21,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 69 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:47:21,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-04 10:47:21,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 57. [2025-03-04 10:47:21,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 56 states have internal predecessors, (60), 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) [2025-03-04 10:47:21,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2025-03-04 10:47:21,849 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 18 [2025-03-04 10:47:21,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:21,849 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2025-03-04 10:47:21,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 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) [2025-03-04 10:47:21,850 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2025-03-04 10:47:21,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 10:47:21,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:21,851 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:21,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:47:22,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 10:47:22,052 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:47:22,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:22,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1612160954, now seen corresponding path program 1 times [2025-03-04 10:47:22,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:22,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931607946] [2025-03-04 10:47:22,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:22,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:22,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:47:22,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:47:22,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:22,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:22,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:47:22,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:22,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931607946] [2025-03-04 10:47:22,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931607946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:22,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:22,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:47:22,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278429979] [2025-03-04 10:47:22,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:22,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:47:22,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:22,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:47:22,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:47:22,129 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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) [2025-03-04 10:47:22,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:22,163 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2025-03-04 10:47:22,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:47:22,163 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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 19 [2025-03-04 10:47:22,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:22,163 INFO L225 Difference]: With dead ends: 57 [2025-03-04 10:47:22,163 INFO L226 Difference]: Without dead ends: 50 [2025-03-04 10:47:22,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:47:22,164 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:22,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:47:22,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-04 10:47:22,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-04 10:47:22,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.108695652173913) internal successors, (51), 49 states have internal predecessors, (51), 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) [2025-03-04 10:47:22,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2025-03-04 10:47:22,168 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 19 [2025-03-04 10:47:22,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:22,168 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2025-03-04 10:47:22,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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) [2025-03-04 10:47:22,169 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2025-03-04 10:47:22,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 10:47:22,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:22,169 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:22,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 10:47:22,169 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:47:22,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:22,170 INFO L85 PathProgramCache]: Analyzing trace with hash 67365262, now seen corresponding path program 2 times [2025-03-04 10:47:22,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:22,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261307073] [2025-03-04 10:47:22,170 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:47:22,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:22,175 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-04 10:47:22,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:47:22,183 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:47:22,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:22,294 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:22,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:22,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261307073] [2025-03-04 10:47:22,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261307073] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:47:22,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885235117] [2025-03-04 10:47:22,295 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:47:22,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:22,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:22,299 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) [2025-03-04 10:47:22,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:47:22,319 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-04 10:47:22,329 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:47:22,329 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:47:22,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:22,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:47:22,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:22,427 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:22,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:47:22,556 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:22,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885235117] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:47:22,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:47:22,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2025-03-04 10:47:22,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714283291] [2025-03-04 10:47:22,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:47:22,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:47:22,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:22,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:47:22,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:47:22,557 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand has 22 states, 21 states have (on average 3.238095238095238) internal successors, (68), 22 states have internal predecessors, (68), 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) [2025-03-04 10:47:22,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:22,730 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2025-03-04 10:47:22,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 10:47:22,731 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.238095238095238) internal successors, (68), 22 states have internal predecessors, (68), 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 33 [2025-03-04 10:47:22,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:22,732 INFO L225 Difference]: With dead ends: 91 [2025-03-04 10:47:22,732 INFO L226 Difference]: Without dead ends: 73 [2025-03-04 10:47:22,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=632, Unknown=0, NotChecked=0, Total=812 [2025-03-04 10:47:22,733 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 22 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:22,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 104 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:47:22,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-04 10:47:22,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2025-03-04 10:47:22,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 65 states have (on average 1.123076923076923) internal successors, (73), 68 states have internal predecessors, (73), 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) [2025-03-04 10:47:22,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2025-03-04 10:47:22,740 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 33 [2025-03-04 10:47:22,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:22,740 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2025-03-04 10:47:22,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.238095238095238) internal successors, (68), 22 states have internal predecessors, (68), 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) [2025-03-04 10:47:22,740 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2025-03-04 10:47:22,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 10:47:22,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:22,741 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1] [2025-03-04 10:47:22,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:47:22,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 10:47:22,942 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:47:22,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:22,942 INFO L85 PathProgramCache]: Analyzing trace with hash 428717704, now seen corresponding path program 2 times [2025-03-04 10:47:22,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:22,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972712029] [2025-03-04 10:47:22,943 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:47:22,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:22,946 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-04 10:47:22,952 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 10:47:22,953 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:47:22,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:23,134 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:23,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:23,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972712029] [2025-03-04 10:47:23,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972712029] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:47:23,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624107835] [2025-03-04 10:47:23,135 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:47:23,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:23,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:23,137 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) [2025-03-04 10:47:23,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:47:23,162 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-04 10:47:23,174 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 10:47:23,174 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:47:23,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:23,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:47:23,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:23,238 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:23,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:47:23,381 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:23,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624107835] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:47:23,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:47:23,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2025-03-04 10:47:23,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575574888] [2025-03-04 10:47:23,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:47:23,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:47:23,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:23,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:47:23,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:47:23,383 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 22 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 22 states have internal predecessors, (80), 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) [2025-03-04 10:47:23,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:23,449 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2025-03-04 10:47:23,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 10:47:23,450 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 22 states have internal predecessors, (80), 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 41 [2025-03-04 10:47:23,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:23,450 INFO L225 Difference]: With dead ends: 119 [2025-03-04 10:47:23,450 INFO L226 Difference]: Without dead ends: 118 [2025-03-04 10:47:23,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:47:23,451 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 34 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:23,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 144 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:47:23,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-04 10:47:23,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 97. [2025-03-04 10:47:23,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 93 states have (on average 1.1720430107526882) internal successors, (109), 96 states have internal predecessors, (109), 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) [2025-03-04 10:47:23,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2025-03-04 10:47:23,456 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 41 [2025-03-04 10:47:23,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:23,456 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2025-03-04 10:47:23,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 22 states have internal predecessors, (80), 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) [2025-03-04 10:47:23,457 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2025-03-04 10:47:23,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 10:47:23,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:23,457 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1] [2025-03-04 10:47:23,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 10:47:23,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:23,658 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:47:23,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:23,659 INFO L85 PathProgramCache]: Analyzing trace with hash 405346928, now seen corresponding path program 2 times [2025-03-04 10:47:23,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:23,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884943945] [2025-03-04 10:47:23,659 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:47:23,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:23,662 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 10:47:23,667 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 10:47:23,670 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:47:23,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:23,720 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:23,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:23,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884943945] [2025-03-04 10:47:23,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884943945] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:47:23,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856815079] [2025-03-04 10:47:23,721 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:47:23,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:23,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:23,723 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) [2025-03-04 10:47:23,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:47:23,745 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 10:47:23,759 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 10:47:23,759 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:47:23,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:23,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:47:23,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:23,800 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:23,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:47:23,872 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:23,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856815079] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:47:23,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:47:23,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-04 10:47:23,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766779295] [2025-03-04 10:47:23,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:47:23,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:47:23,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:23,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:47:23,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:47:23,874 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand has 12 states, 11 states have (on average 7.454545454545454) internal successors, (82), 12 states have internal predecessors, (82), 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) [2025-03-04 10:47:23,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:23,901 INFO L93 Difference]: Finished difference Result 118 states and 123 transitions. [2025-03-04 10:47:23,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:47:23,901 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.454545454545454) internal successors, (82), 12 states have internal predecessors, (82), 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 42 [2025-03-04 10:47:23,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:23,902 INFO L225 Difference]: With dead ends: 118 [2025-03-04 10:47:23,902 INFO L226 Difference]: Without dead ends: 117 [2025-03-04 10:47:23,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:47:23,902 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 28 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:23,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 115 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:47:23,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-04 10:47:23,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 98. [2025-03-04 10:47:23,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 94 states have (on average 1.1170212765957446) internal successors, (105), 97 states have internal predecessors, (105), 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) [2025-03-04 10:47:23,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2025-03-04 10:47:23,907 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 42 [2025-03-04 10:47:23,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:23,907 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2025-03-04 10:47:23,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.454545454545454) internal successors, (82), 12 states have internal predecessors, (82), 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) [2025-03-04 10:47:23,908 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2025-03-04 10:47:23,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 10:47:23,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:23,909 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2025-03-04 10:47:23,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 10:47:24,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:24,110 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:47:24,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:24,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1004052604, now seen corresponding path program 2 times [2025-03-04 10:47:24,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:24,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056075057] [2025-03-04 10:47:24,110 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:47:24,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:24,114 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-03-04 10:47:24,122 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 10:47:24,123 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:47:24,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:24,307 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:24,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:24,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056075057] [2025-03-04 10:47:24,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056075057] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:47:24,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682401514] [2025-03-04 10:47:24,308 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:47:24,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:24,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:24,310 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) [2025-03-04 10:47:24,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:47:24,335 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-03-04 10:47:24,353 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 10:47:24,353 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:47:24,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:24,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:47:24,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:24,418 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:24,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:47:24,647 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:24,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682401514] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:47:24,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:47:24,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2025-03-04 10:47:24,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421866605] [2025-03-04 10:47:24,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:47:24,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 10:47:24,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:24,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 10:47:24,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2025-03-04 10:47:24,648 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 30 states, 29 states have (on average 3.7241379310344827) internal successors, (108), 30 states have internal predecessors, (108), 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) [2025-03-04 10:47:24,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:24,733 INFO L93 Difference]: Finished difference Result 162 states and 176 transitions. [2025-03-04 10:47:24,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 10:47:24,733 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.7241379310344827) internal successors, (108), 30 states have internal predecessors, (108), 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 55 [2025-03-04 10:47:24,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:24,734 INFO L225 Difference]: With dead ends: 162 [2025-03-04 10:47:24,734 INFO L226 Difference]: Without dead ends: 161 [2025-03-04 10:47:24,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2025-03-04 10:47:24,735 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 72 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:24,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 163 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:47:24,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-04 10:47:24,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 127. [2025-03-04 10:47:24,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 123 states have (on average 1.1382113821138211) internal successors, (140), 126 states have internal predecessors, (140), 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) [2025-03-04 10:47:24,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 140 transitions. [2025-03-04 10:47:24,740 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 140 transitions. Word has length 55 [2025-03-04 10:47:24,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:24,741 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 140 transitions. [2025-03-04 10:47:24,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.7241379310344827) internal successors, (108), 30 states have internal predecessors, (108), 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) [2025-03-04 10:47:24,742 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 140 transitions. [2025-03-04 10:47:24,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 10:47:24,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:24,743 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:24,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 10:47:24,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:24,944 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:47:24,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:24,944 INFO L85 PathProgramCache]: Analyzing trace with hash -872456590, now seen corresponding path program 3 times [2025-03-04 10:47:24,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:24,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911601005] [2025-03-04 10:47:24,945 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:47:24,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:24,951 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 65 statements into 8 equivalence classes. [2025-03-04 10:47:24,972 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 10:47:24,973 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-04 10:47:24,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:25,251 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:25,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:25,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911601005] [2025-03-04 10:47:25,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911601005] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:47:25,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691079666] [2025-03-04 10:47:25,252 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:47:25,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:25,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:25,256 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) [2025-03-04 10:47:25,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:47:25,280 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 65 statements into 8 equivalence classes. [2025-03-04 10:47:25,300 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 10:47:25,300 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-04 10:47:25,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:25,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:47:25,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:25,651 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:25,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:47:26,104 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:26,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691079666] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:47:26,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:47:26,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 52 [2025-03-04 10:47:26,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376313135] [2025-03-04 10:47:26,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:47:26,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-04 10:47:26,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:26,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-04 10:47:26,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=393, Invalid=2363, Unknown=0, NotChecked=0, Total=2756 [2025-03-04 10:47:26,107 INFO L87 Difference]: Start difference. First operand 127 states and 140 transitions. Second operand has 53 states, 52 states have (on average 3.673076923076923) internal successors, (191), 53 states have internal predecessors, (191), 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) [2025-03-04 10:47:26,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:26,841 INFO L93 Difference]: Finished difference Result 174 states and 184 transitions. [2025-03-04 10:47:26,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-03-04 10:47:26,841 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 3.673076923076923) internal successors, (191), 53 states have internal predecessors, (191), 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 65 [2025-03-04 10:47:26,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:26,842 INFO L225 Difference]: With dead ends: 174 [2025-03-04 10:47:26,842 INFO L226 Difference]: Without dead ends: 140 [2025-03-04 10:47:26,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1978 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1241, Invalid=6769, Unknown=0, NotChecked=0, Total=8010 [2025-03-04 10:47:26,844 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 110 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:26,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 210 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:47:26,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-04 10:47:26,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 133. [2025-03-04 10:47:26,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 129 states have (on average 1.062015503875969) internal successors, (137), 132 states have internal predecessors, (137), 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) [2025-03-04 10:47:26,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 137 transitions. [2025-03-04 10:47:26,849 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 137 transitions. Word has length 65 [2025-03-04 10:47:26,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:26,849 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 137 transitions. [2025-03-04 10:47:26,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 3.673076923076923) internal successors, (191), 53 states have internal predecessors, (191), 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) [2025-03-04 10:47:26,849 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2025-03-04 10:47:26,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 10:47:26,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:26,849 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 1, 1, 1, 1] [2025-03-04 10:47:26,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 10:47:27,054 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,SelfDestructingSolverStorable20 [2025-03-04 10:47:27,054 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:47:27,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:27,054 INFO L85 PathProgramCache]: Analyzing trace with hash 364429786, now seen corresponding path program 3 times [2025-03-04 10:47:27,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:27,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248599821] [2025-03-04 10:47:27,054 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:47:27,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:27,059 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 90 statements into 11 equivalence classes. [2025-03-04 10:47:27,084 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 10:47:27,084 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 10:47:27,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:27,259 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 0 proven. 430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:27,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:27,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248599821] [2025-03-04 10:47:27,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248599821] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:47:27,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062081625] [2025-03-04 10:47:27,260 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:47:27,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:27,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:27,262 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) [2025-03-04 10:47:27,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:47:27,287 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 90 statements into 11 equivalence classes. [2025-03-04 10:47:27,311 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 10:47:27,311 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 10:47:27,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:27,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:47:27,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:27,396 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 0 proven. 430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:27,396 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:47:27,613 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 0 proven. 430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:27,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062081625] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:47:27,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:47:27,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-03-04 10:47:27,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434984623] [2025-03-04 10:47:27,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:47:27,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:47:27,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:27,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:47:27,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:47:27,616 INFO L87 Difference]: Start difference. First operand 133 states and 137 transitions. Second operand has 24 states, 23 states have (on average 7.739130434782608) internal successors, (178), 24 states have internal predecessors, (178), 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) [2025-03-04 10:47:27,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:27,672 INFO L93 Difference]: Finished difference Result 246 states and 257 transitions. [2025-03-04 10:47:27,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 10:47:27,675 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 7.739130434782608) internal successors, (178), 24 states have internal predecessors, (178), 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 90 [2025-03-04 10:47:27,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:27,676 INFO L225 Difference]: With dead ends: 246 [2025-03-04 10:47:27,676 INFO L226 Difference]: Without dead ends: 245 [2025-03-04 10:47:27,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:47:27,677 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 94 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:27,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 226 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:47:27,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-04 10:47:27,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 194. [2025-03-04 10:47:27,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 190 states have (on average 1.1421052631578947) internal successors, (217), 193 states have internal predecessors, (217), 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) [2025-03-04 10:47:27,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 217 transitions. [2025-03-04 10:47:27,687 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 217 transitions. Word has length 90 [2025-03-04 10:47:27,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:27,687 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 217 transitions. [2025-03-04 10:47:27,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 7.739130434782608) internal successors, (178), 24 states have internal predecessors, (178), 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) [2025-03-04 10:47:27,688 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 217 transitions. [2025-03-04 10:47:27,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 10:47:27,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:27,690 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1] [2025-03-04 10:47:27,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 10:47:27,895 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,SelfDestructingSolverStorable21 [2025-03-04 10:47:27,895 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:47:27,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:27,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1230375868, now seen corresponding path program 3 times [2025-03-04 10:47:27,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:27,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242227288] [2025-03-04 10:47:27,895 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:47:27,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:27,902 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 119 statements into 15 equivalence classes. [2025-03-04 10:47:27,945 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 10:47:27,945 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-03-04 10:47:27,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:28,619 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:28,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:28,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242227288] [2025-03-04 10:47:28,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242227288] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:47:28,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697979205] [2025-03-04 10:47:28,619 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:47:28,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:28,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:28,621 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) [2025-03-04 10:47:28,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:47:28,646 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 119 statements into 15 equivalence classes. [2025-03-04 10:47:28,680 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 10:47:28,680 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-03-04 10:47:28,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:28,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 10:47:28,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:28,806 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:28,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:47:29,478 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:29,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697979205] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:47:29,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:47:29,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2025-03-04 10:47:29,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148444603] [2025-03-04 10:47:29,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:47:29,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-03-04 10:47:29,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:29,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-03-04 10:47:29,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=2791, Unknown=0, NotChecked=0, Total=3782 [2025-03-04 10:47:29,480 INFO L87 Difference]: Start difference. First operand 194 states and 217 transitions. Second operand has 62 states, 61 states have (on average 3.8688524590163933) internal successors, (236), 62 states have internal predecessors, (236), 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) [2025-03-04 10:47:29,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:29,651 INFO L93 Difference]: Finished difference Result 338 states and 368 transitions. [2025-03-04 10:47:29,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-03-04 10:47:29,651 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 3.8688524590163933) internal successors, (236), 62 states have internal predecessors, (236), 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 119 [2025-03-04 10:47:29,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:29,652 INFO L225 Difference]: With dead ends: 338 [2025-03-04 10:47:29,652 INFO L226 Difference]: Without dead ends: 337 [2025-03-04 10:47:29,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=991, Invalid=2791, Unknown=0, NotChecked=0, Total=3782 [2025-03-04 10:47:29,654 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 230 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:29,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 311 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:47:29,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-04 10:47:29,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 255. [2025-03-04 10:47:29,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 251 states have (on average 1.1633466135458168) internal successors, (292), 254 states have internal predecessors, (292), 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) [2025-03-04 10:47:29,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 292 transitions. [2025-03-04 10:47:29,662 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 292 transitions. Word has length 119 [2025-03-04 10:47:29,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:29,662 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 292 transitions. [2025-03-04 10:47:29,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 3.8688524590163933) internal successors, (236), 62 states have internal predecessors, (236), 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) [2025-03-04 10:47:29,662 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 292 transitions. [2025-03-04 10:47:29,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 10:47:29,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:29,663 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 14, 14, 14, 1, 1, 1, 1] [2025-03-04 10:47:29,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 10:47:29,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 10:47:29,868 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:47:29,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:29,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1275202878, now seen corresponding path program 3 times [2025-03-04 10:47:29,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:29,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010696395] [2025-03-04 10:47:29,868 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:47:29,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:29,872 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 121 statements into 15 equivalence classes. [2025-03-04 10:47:29,898 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 10:47:29,898 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-03-04 10:47:29,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:30,444 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:30,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:30,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010696395] [2025-03-04 10:47:30,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010696395] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:47:30,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856791034] [2025-03-04 10:47:30,445 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:47:30,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:30,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:30,446 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) [2025-03-04 10:47:30,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:47:30,495 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 121 statements into 15 equivalence classes. [2025-03-04 10:47:30,533 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 10:47:30,533 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-03-04 10:47:30,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:30,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 10:47:30,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:30,656 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:30,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:47:31,268 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:31,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856791034] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:47:31,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:47:31,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2025-03-04 10:47:31,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414123839] [2025-03-04 10:47:31,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:47:31,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-03-04 10:47:31,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:31,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-03-04 10:47:31,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=2791, Unknown=0, NotChecked=0, Total=3782 [2025-03-04 10:47:31,270 INFO L87 Difference]: Start difference. First operand 255 states and 292 transitions. Second operand has 62 states, 61 states have (on average 3.9344262295081966) internal successors, (240), 62 states have internal predecessors, (240), 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) [2025-03-04 10:47:31,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:31,433 INFO L93 Difference]: Finished difference Result 325 states and 355 transitions. [2025-03-04 10:47:31,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-03-04 10:47:31,433 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 3.9344262295081966) internal successors, (240), 62 states have internal predecessors, (240), 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 121 [2025-03-04 10:47:31,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:31,434 INFO L225 Difference]: With dead ends: 325 [2025-03-04 10:47:31,435 INFO L226 Difference]: Without dead ends: 324 [2025-03-04 10:47:31,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=991, Invalid=2791, Unknown=0, NotChecked=0, Total=3782 [2025-03-04 10:47:31,436 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 132 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:31,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 335 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:47:31,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-03-04 10:47:31,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 257. [2025-03-04 10:47:31,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 253 states have (on average 1.1027667984189724) internal successors, (279), 256 states have internal predecessors, (279), 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) [2025-03-04 10:47:31,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 279 transitions. [2025-03-04 10:47:31,443 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 279 transitions. Word has length 121 [2025-03-04 10:47:31,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:31,443 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 279 transitions. [2025-03-04 10:47:31,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 3.9344262295081966) internal successors, (240), 62 states have internal predecessors, (240), 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) [2025-03-04 10:47:31,444 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 279 transitions. [2025-03-04 10:47:31,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 10:47:31,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:31,444 INFO L218 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:31,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 10:47:31,644 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,SelfDestructingSolverStorable23 [2025-03-04 10:47:31,645 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:47:31,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:31,645 INFO L85 PathProgramCache]: Analyzing trace with hash 774936634, now seen corresponding path program 4 times [2025-03-04 10:47:31,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:31,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903690369] [2025-03-04 10:47:31,645 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:47:31,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:31,650 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 129 statements into 2 equivalence classes. [2025-03-04 10:47:31,662 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 10:47:31,662 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:47:31,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:32,242 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:32,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:32,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903690369] [2025-03-04 10:47:32,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903690369] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:47:32,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121120415] [2025-03-04 10:47:32,243 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:47:32,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:32,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:32,245 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) [2025-03-04 10:47:32,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:47:32,271 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 129 statements into 2 equivalence classes. [2025-03-04 10:47:32,302 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 10:47:32,303 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:47:32,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:32,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-03-04 10:47:32,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:33,286 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:33,286 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:47:34,551 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:34,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121120415] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:47:34,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:47:34,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 47, 47] total 127 [2025-03-04 10:47:34,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957613084] [2025-03-04 10:47:34,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:47:34,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 128 states [2025-03-04 10:47:34,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:34,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2025-03-04 10:47:34,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2302, Invalid=13954, Unknown=0, NotChecked=0, Total=16256 [2025-03-04 10:47:34,556 INFO L87 Difference]: Start difference. First operand 257 states and 279 transitions. Second operand has 128 states, 127 states have (on average 3.015748031496063) internal successors, (383), 128 states have internal predecessors, (383), 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) [2025-03-04 10:47:34,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:34,906 INFO L93 Difference]: Finished difference Result 334 states and 349 transitions. [2025-03-04 10:47:34,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2025-03-04 10:47:34,906 INFO L78 Accepts]: Start accepts. Automaton has has 128 states, 127 states have (on average 3.015748031496063) internal successors, (383), 128 states have internal predecessors, (383), 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 129 [2025-03-04 10:47:34,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:34,907 INFO L225 Difference]: With dead ends: 334 [2025-03-04 10:47:34,907 INFO L226 Difference]: Without dead ends: 269 [2025-03-04 10:47:34,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10127 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2412, Invalid=14618, Unknown=0, NotChecked=0, Total=17030 [2025-03-04 10:47:34,914 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 166 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:34,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 306 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:47:34,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-04 10:47:34,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 261. [2025-03-04 10:47:34,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 257 states have (on average 1.046692607003891) internal successors, (269), 260 states have internal predecessors, (269), 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) [2025-03-04 10:47:34,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 269 transitions. [2025-03-04 10:47:34,924 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 269 transitions. Word has length 129 [2025-03-04 10:47:34,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:34,924 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 269 transitions. [2025-03-04 10:47:34,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 128 states, 127 states have (on average 3.015748031496063) internal successors, (383), 128 states have internal predecessors, (383), 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) [2025-03-04 10:47:34,925 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 269 transitions. [2025-03-04 10:47:34,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-04 10:47:34,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:34,926 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 22, 22, 1, 1, 1, 1] [2025-03-04 10:47:34,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 10:47:35,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:35,130 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:47:35,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:35,130 INFO L85 PathProgramCache]: Analyzing trace with hash -99656530, now seen corresponding path program 4 times [2025-03-04 10:47:35,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:35,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654090399] [2025-03-04 10:47:35,130 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:47:35,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:35,138 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 186 statements into 2 equivalence classes. [2025-03-04 10:47:35,153 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 186 of 186 statements. [2025-03-04 10:47:35,153 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:47:35,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:35,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:35,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:35,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654090399] [2025-03-04 10:47:35,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654090399] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:47:35,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455882773] [2025-03-04 10:47:35,595 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:47:35,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:35,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:35,599 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) [2025-03-04 10:47:35,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:47:35,630 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 186 statements into 2 equivalence classes. [2025-03-04 10:47:35,674 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 186 of 186 statements. [2025-03-04 10:47:35,674 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:47:35,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:35,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 10:47:35,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:35,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:35,838 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:47:36,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:36,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455882773] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:47:36,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:47:36,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-03-04 10:47:36,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347073487] [2025-03-04 10:47:36,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:47:36,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-04 10:47:36,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:36,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-04 10:47:36,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 10:47:36,583 INFO L87 Difference]: Start difference. First operand 261 states and 269 transitions. Second operand has 48 states, 47 states have (on average 7.872340425531915) internal successors, (370), 48 states have internal predecessors, (370), 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) [2025-03-04 10:47:36,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:36,721 INFO L93 Difference]: Finished difference Result 494 states and 517 transitions. [2025-03-04 10:47:36,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-04 10:47:36,721 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 7.872340425531915) internal successors, (370), 48 states have internal predecessors, (370), 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 186 [2025-03-04 10:47:36,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:36,723 INFO L225 Difference]: With dead ends: 494 [2025-03-04 10:47:36,723 INFO L226 Difference]: Without dead ends: 493 [2025-03-04 10:47:36,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 10:47:36,724 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 255 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:36,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 426 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:47:36,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-03-04 10:47:36,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 386. [2025-03-04 10:47:36,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 382 states have (on average 1.1335078534031413) internal successors, (433), 385 states have internal predecessors, (433), 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) [2025-03-04 10:47:36,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 433 transitions. [2025-03-04 10:47:36,737 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 433 transitions. Word has length 186 [2025-03-04 10:47:36,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:36,738 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 433 transitions. [2025-03-04 10:47:36,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 7.872340425531915) internal successors, (370), 48 states have internal predecessors, (370), 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) [2025-03-04 10:47:36,738 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 433 transitions. [2025-03-04 10:47:36,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-03-04 10:47:36,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:36,739 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 30, 30, 30, 30, 30, 1, 1, 1, 1] [2025-03-04 10:47:36,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 10:47:36,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 10:47:36,940 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:47:36,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:36,941 INFO L85 PathProgramCache]: Analyzing trace with hash 986045396, now seen corresponding path program 4 times [2025-03-04 10:47:36,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:36,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230065417] [2025-03-04 10:47:36,941 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:47:36,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:36,949 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 247 statements into 2 equivalence classes. [2025-03-04 10:47:36,982 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 247 of 247 statements. [2025-03-04 10:47:36,982 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:47:36,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:38,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:38,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:38,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230065417] [2025-03-04 10:47:38,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230065417] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:47:38,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686688307] [2025-03-04 10:47:38,750 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:47:38,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:38,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:38,751 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) [2025-03-04 10:47:38,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 10:47:38,789 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 247 statements into 2 equivalence classes. [2025-03-04 10:47:38,844 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 247 of 247 statements. [2025-03-04 10:47:38,844 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:47:38,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:38,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-04 10:47:38,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:39,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:39,064 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:47:41,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:41,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686688307] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:47:41,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:47:41,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 126 [2025-03-04 10:47:41,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656309842] [2025-03-04 10:47:41,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:47:41,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 127 states [2025-03-04 10:47:41,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:41,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2025-03-04 10:47:41,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=11907, Unknown=0, NotChecked=0, Total=16002 [2025-03-04 10:47:41,448 INFO L87 Difference]: Start difference. First operand 386 states and 433 transitions. Second operand has 127 states, 126 states have (on average 3.9285714285714284) internal successors, (495), 127 states have internal predecessors, (495), 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) [2025-03-04 10:47:41,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:41,856 INFO L93 Difference]: Finished difference Result 682 states and 744 transitions. [2025-03-04 10:47:41,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2025-03-04 10:47:41,856 INFO L78 Accepts]: Start accepts. Automaton has has 127 states, 126 states have (on average 3.9285714285714284) internal successors, (495), 127 states have internal predecessors, (495), 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 247 [2025-03-04 10:47:41,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:41,859 INFO L225 Difference]: With dead ends: 682 [2025-03-04 10:47:41,859 INFO L226 Difference]: Without dead ends: 681 [2025-03-04 10:47:41,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 431 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4833 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4095, Invalid=11907, Unknown=0, NotChecked=0, Total=16002 [2025-03-04 10:47:41,862 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 606 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:41,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 511 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:47:41,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2025-03-04 10:47:41,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 511. [2025-03-04 10:47:41,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 507 states have (on average 1.1597633136094674) internal successors, (588), 510 states have internal predecessors, (588), 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) [2025-03-04 10:47:41,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 588 transitions. [2025-03-04 10:47:41,877 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 588 transitions. Word has length 247 [2025-03-04 10:47:41,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:41,877 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 588 transitions. [2025-03-04 10:47:41,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 127 states, 126 states have (on average 3.9285714285714284) internal successors, (495), 127 states have internal predecessors, (495), 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) [2025-03-04 10:47:41,877 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 588 transitions. [2025-03-04 10:47:41,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-04 10:47:41,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:41,878 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 31, 31, 30, 30, 30, 1, 1, 1, 1] [2025-03-04 10:47:41,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 10:47:42,079 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,SelfDestructingSolverStorable26 [2025-03-04 10:47:42,079 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:47:42,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:42,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1598146990, now seen corresponding path program 4 times [2025-03-04 10:47:42,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:42,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571452665] [2025-03-04 10:47:42,080 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:47:42,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:42,086 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 249 statements into 2 equivalence classes. [2025-03-04 10:47:42,116 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 249 of 249 statements. [2025-03-04 10:47:42,116 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:47:42,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:43,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:43,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:43,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571452665] [2025-03-04 10:47:43,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571452665] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:47:43,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306990917] [2025-03-04 10:47:43,651 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:47:43,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:43,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:43,652 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) [2025-03-04 10:47:43,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 10:47:43,684 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 249 statements into 2 equivalence classes. [2025-03-04 10:47:43,727 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 249 of 249 statements. [2025-03-04 10:47:43,727 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:47:43,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:43,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-03-04 10:47:43,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:43,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:43,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:47:46,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:46,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306990917] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:47:46,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:47:46,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 63, 63] total 126 [2025-03-04 10:47:46,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250683894] [2025-03-04 10:47:46,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:47:46,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 127 states [2025-03-04 10:47:46,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:46,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2025-03-04 10:47:46,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=11907, Unknown=0, NotChecked=0, Total=16002 [2025-03-04 10:47:46,358 INFO L87 Difference]: Start difference. First operand 511 states and 588 transitions. Second operand has 127 states, 126 states have (on average 3.9603174603174605) internal successors, (499), 127 states have internal predecessors, (499), 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) [2025-03-04 10:47:46,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:46,785 INFO L93 Difference]: Finished difference Result 653 states and 715 transitions. [2025-03-04 10:47:46,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2025-03-04 10:47:46,786 INFO L78 Accepts]: Start accepts. Automaton has has 127 states, 126 states have (on average 3.9603174603174605) internal successors, (499), 127 states have internal predecessors, (499), 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 249 [2025-03-04 10:47:46,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:46,788 INFO L225 Difference]: With dead ends: 653 [2025-03-04 10:47:46,788 INFO L226 Difference]: Without dead ends: 652 [2025-03-04 10:47:46,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 436 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4683 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4095, Invalid=11907, Unknown=0, NotChecked=0, Total=16002 [2025-03-04 10:47:46,790 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 392 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:46,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 477 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:47:46,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-03-04 10:47:46,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 513. [2025-03-04 10:47:46,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 509 states have (on average 1.0982318271119842) internal successors, (559), 512 states have internal predecessors, (559), 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) [2025-03-04 10:47:46,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 559 transitions. [2025-03-04 10:47:46,804 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 559 transitions. Word has length 249 [2025-03-04 10:47:46,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:46,805 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 559 transitions. [2025-03-04 10:47:46,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 127 states, 126 states have (on average 3.9603174603174605) internal successors, (499), 127 states have internal predecessors, (499), 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) [2025-03-04 10:47:46,805 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 559 transitions. [2025-03-04 10:47:46,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-03-04 10:47:46,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:46,807 INFO L218 NwaCegarLoop]: trace histogram [32, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:46,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 10:47:47,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 10:47:47,007 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:47:47,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:47,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1434694710, now seen corresponding path program 5 times [2025-03-04 10:47:47,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:47,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481034411] [2025-03-04 10:47:47,008 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:47:47,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:47,016 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 257 statements into 32 equivalence classes. [2025-03-04 10:47:47,086 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) and asserted 257 of 257 statements. [2025-03-04 10:47:47,086 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2025-03-04 10:47:47,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:48,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:48,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:48,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481034411] [2025-03-04 10:47:48,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481034411] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:47:48,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766698975] [2025-03-04 10:47:48,815 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:47:48,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:48,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:48,817 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) [2025-03-04 10:47:48,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 10:47:48,851 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 257 statements into 32 equivalence classes. [2025-03-04 10:47:48,938 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) and asserted 257 of 257 statements. [2025-03-04 10:47:48,938 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2025-03-04 10:47:48,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:48,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 127 conjuncts are in the unsatisfiable core [2025-03-04 10:47:48,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:51,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:51,517 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:47:55,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:55,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766698975] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:47:55,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:47:55,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 95, 95] total 254 [2025-03-04 10:47:55,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484457634] [2025-03-04 10:47:55,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:47:55,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 255 states [2025-03-04 10:47:55,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:55,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 255 interpolants. [2025-03-04 10:47:55,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8883, Invalid=55887, Unknown=0, NotChecked=0, Total=64770 [2025-03-04 10:47:55,285 INFO L87 Difference]: Start difference. First operand 513 states and 559 transitions. Second operand has 255 states, 254 states have (on average 3.0196850393700787) internal successors, (767), 255 states have internal predecessors, (767), 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) [2025-03-04 10:47:55,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:55,874 INFO L93 Difference]: Finished difference Result 662 states and 693 transitions. [2025-03-04 10:47:55,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2025-03-04 10:47:55,874 INFO L78 Accepts]: Start accepts. Automaton has has 255 states, 254 states have (on average 3.0196850393700787) internal successors, (767), 255 states have internal predecessors, (767), 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 257 [2025-03-04 10:47:55,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:55,876 INFO L225 Difference]: With dead ends: 662 [2025-03-04 10:47:55,876 INFO L226 Difference]: Without dead ends: 533 [2025-03-04 10:47:55,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42469 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=8883, Invalid=55887, Unknown=0, NotChecked=0, Total=64770 [2025-03-04 10:47:55,878 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 617 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:55,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 487 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:47:55,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-03-04 10:47:55,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 517. [2025-03-04 10:47:55,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 513 states have (on average 1.0389863547758285) internal successors, (533), 516 states have internal predecessors, (533), 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) [2025-03-04 10:47:55,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 533 transitions. [2025-03-04 10:47:55,891 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 533 transitions. Word has length 257 [2025-03-04 10:47:55,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:55,891 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 533 transitions. [2025-03-04 10:47:55,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 255 states, 254 states have (on average 3.0196850393700787) internal successors, (767), 255 states have internal predecessors, (767), 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) [2025-03-04 10:47:55,891 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 533 transitions. [2025-03-04 10:47:55,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-03-04 10:47:55,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:55,894 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 46, 46, 1, 1, 1, 1] [2025-03-04 10:47:55,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 10:47:56,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 10:47:56,095 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:47:56,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:56,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1795571114, now seen corresponding path program 5 times [2025-03-04 10:47:56,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:56,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664507064] [2025-03-04 10:47:56,095 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:47:56,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:56,104 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 378 statements into 47 equivalence classes. [2025-03-04 10:47:56,181 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 378 of 378 statements. [2025-03-04 10:47:56,181 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-04 10:47:56,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:57,434 INFO L134 CoverageAnalysis]: Checked inductivity of 8602 backedges. 0 proven. 8602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:57,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:57,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664507064] [2025-03-04 10:47:57,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664507064] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:47:57,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4796743] [2025-03-04 10:47:57,434 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:47:57,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:57,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:57,436 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) [2025-03-04 10:47:57,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 10:47:57,474 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 378 statements into 47 equivalence classes. [2025-03-04 10:47:57,631 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 378 of 378 statements. [2025-03-04 10:47:57,631 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-04 10:47:57,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:57,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-04 10:47:57,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:57,933 INFO L134 CoverageAnalysis]: Checked inductivity of 8602 backedges. 0 proven. 8602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:47:57,933 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:48:00,001 INFO L134 CoverageAnalysis]: Checked inductivity of 8602 backedges. 0 proven. 8602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:48:00,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4796743] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:48:00,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:48:00,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2025-03-04 10:48:00,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387233286] [2025-03-04 10:48:00,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:48:00,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-03-04 10:48:00,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:48:00,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-03-04 10:48:00,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-03-04 10:48:00,008 INFO L87 Difference]: Start difference. First operand 517 states and 533 transitions. Second operand has 96 states, 95 states have (on average 7.936842105263158) internal successors, (754), 96 states have internal predecessors, (754), 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) [2025-03-04 10:48:00,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:48:00,331 INFO L93 Difference]: Finished difference Result 990 states and 1037 transitions. [2025-03-04 10:48:00,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-04 10:48:00,331 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 7.936842105263158) internal successors, (754), 96 states have internal predecessors, (754), 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 378 [2025-03-04 10:48:00,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:48:00,334 INFO L225 Difference]: With dead ends: 990 [2025-03-04 10:48:00,334 INFO L226 Difference]: Without dead ends: 989 [2025-03-04 10:48:00,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 802 GetRequests, 708 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-03-04 10:48:00,335 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 639 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:48:00,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 844 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:48:00,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2025-03-04 10:48:00,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 770. [2025-03-04 10:48:00,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 766 states have (on average 1.129242819843342) internal successors, (865), 769 states have internal predecessors, (865), 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) [2025-03-04 10:48:00,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 865 transitions. [2025-03-04 10:48:00,353 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 865 transitions. Word has length 378 [2025-03-04 10:48:00,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:48:00,353 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 865 transitions. [2025-03-04 10:48:00,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 7.936842105263158) internal successors, (754), 96 states have internal predecessors, (754), 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) [2025-03-04 10:48:00,353 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 865 transitions. [2025-03-04 10:48:00,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2025-03-04 10:48:00,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:48:00,357 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 62, 62, 62, 62, 62, 1, 1, 1, 1] [2025-03-04 10:48:00,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 10:48:00,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:00,558 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:48:00,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:48:00,558 INFO L85 PathProgramCache]: Analyzing trace with hash -186471692, now seen corresponding path program 5 times [2025-03-04 10:48:00,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:48:00,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720841863] [2025-03-04 10:48:00,558 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:48:00,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:48:00,569 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 503 statements into 63 equivalence classes. [2025-03-04 10:48:00,682 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 63 check-sat command(s) and asserted 503 of 503 statements. [2025-03-04 10:48:00,682 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 63 check-sat command(s) [2025-03-04 10:48:00,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:06,522 INFO L134 CoverageAnalysis]: Checked inductivity of 15376 backedges. 0 proven. 15376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:48:06,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:48:06,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720841863] [2025-03-04 10:48:06,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720841863] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:48:06,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445461715] [2025-03-04 10:48:06,523 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:48:06,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:06,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:48:06,524 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) [2025-03-04 10:48:06,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 10:48:06,576 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 503 statements into 63 equivalence classes. [2025-03-04 10:48:06,881 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 63 check-sat command(s) and asserted 503 of 503 statements. [2025-03-04 10:48:06,881 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 63 check-sat command(s) [2025-03-04 10:48:06,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:06,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 1151 conjuncts, 128 conjuncts are in the unsatisfiable core [2025-03-04 10:48:06,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:48:07,228 INFO L134 CoverageAnalysis]: Checked inductivity of 15376 backedges. 0 proven. 15376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:48:07,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:48:15,757 INFO L134 CoverageAnalysis]: Checked inductivity of 15376 backedges. 0 proven. 15376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:48:15,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445461715] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:48:15,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:48:15,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [127, 127, 127] total 253 [2025-03-04 10:48:15,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936696740] [2025-03-04 10:48:15,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:48:15,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 254 states [2025-03-04 10:48:15,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:48:15,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 254 interpolants. [2025-03-04 10:48:15,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16255, Invalid=48007, Unknown=0, NotChecked=0, Total=64262 [2025-03-04 10:48:15,764 INFO L87 Difference]: Start difference. First operand 770 states and 865 transitions. Second operand has 254 states, 253 states have (on average 3.9683794466403164) internal successors, (1004), 254 states have internal predecessors, (1004), 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) [2025-03-04 10:48:17,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:48:17,208 INFO L93 Difference]: Finished difference Result 1370 states and 1496 transitions. [2025-03-04 10:48:17,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 254 states. [2025-03-04 10:48:17,209 INFO L78 Accepts]: Start accepts. Automaton has has 254 states, 253 states have (on average 3.9683794466403164) internal successors, (1004), 254 states have internal predecessors, (1004), 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 503 [2025-03-04 10:48:17,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:48:17,212 INFO L225 Difference]: With dead ends: 1370 [2025-03-04 10:48:17,212 INFO L226 Difference]: Without dead ends: 1369 [2025-03-04 10:48:17,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1131 GetRequests, 879 SyntacticMatches, 0 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19469 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=16255, Invalid=48007, Unknown=0, NotChecked=0, Total=64262 [2025-03-04 10:48:17,214 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 1541 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1541 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:48:17,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1541 Valid, 949 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:48:17,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2025-03-04 10:48:17,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1023. [2025-03-04 10:48:17,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1019 states have (on average 1.1579980372914622) internal successors, (1180), 1022 states have internal predecessors, (1180), 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) [2025-03-04 10:48:17,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1180 transitions. [2025-03-04 10:48:17,239 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1180 transitions. Word has length 503 [2025-03-04 10:48:17,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:48:17,240 INFO L471 AbstractCegarLoop]: Abstraction has 1023 states and 1180 transitions. [2025-03-04 10:48:17,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 254 states, 253 states have (on average 3.9683794466403164) internal successors, (1004), 254 states have internal predecessors, (1004), 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) [2025-03-04 10:48:17,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1180 transitions. [2025-03-04 10:48:17,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2025-03-04 10:48:17,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:48:17,243 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 63, 63, 62, 62, 62, 1, 1, 1, 1] [2025-03-04 10:48:17,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-04 10:48:17,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-03-04 10:48:17,444 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:48:17,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:48:17,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1189330290, now seen corresponding path program 5 times [2025-03-04 10:48:17,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:48:17,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51270315] [2025-03-04 10:48:17,444 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:48:17,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:48:17,457 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 505 statements into 63 equivalence classes. [2025-03-04 10:48:17,554 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 63 check-sat command(s) and asserted 505 of 505 statements. [2025-03-04 10:48:17,554 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 63 check-sat command(s) [2025-03-04 10:48:17,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:23,615 INFO L134 CoverageAnalysis]: Checked inductivity of 15500 backedges. 0 proven. 15500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:48:23,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:48:23,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51270315] [2025-03-04 10:48:23,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51270315] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:48:23,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892492811] [2025-03-04 10:48:23,616 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:48:23,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:23,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:48:23,623 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:48:23,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 10:48:23,676 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 505 statements into 63 equivalence classes. [2025-03-04 10:48:23,977 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 63 check-sat command(s) and asserted 505 of 505 statements. [2025-03-04 10:48:23,977 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 63 check-sat command(s) [2025-03-04 10:48:23,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:23,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 1157 conjuncts, 127 conjuncts are in the unsatisfiable core [2025-03-04 10:48:23,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:48:24,348 INFO L134 CoverageAnalysis]: Checked inductivity of 15500 backedges. 0 proven. 15500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:48:24,349 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:48:32,721 INFO L134 CoverageAnalysis]: Checked inductivity of 15500 backedges. 0 proven. 15500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:48:32,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892492811] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:48:32,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:48:32,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [127, 127, 127] total 253 [2025-03-04 10:48:32,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150727874] [2025-03-04 10:48:32,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:48:32,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 254 states [2025-03-04 10:48:32,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:48:32,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 254 interpolants. [2025-03-04 10:48:32,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16255, Invalid=48007, Unknown=0, NotChecked=0, Total=64262 [2025-03-04 10:48:32,727 INFO L87 Difference]: Start difference. First operand 1023 states and 1180 transitions. Second operand has 254 states, 253 states have (on average 3.984189723320158) internal successors, (1008), 254 states have internal predecessors, (1008), 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) [2025-03-04 10:48:33,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:48:33,989 INFO L93 Difference]: Finished difference Result 1309 states and 1435 transitions. [2025-03-04 10:48:33,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 254 states. [2025-03-04 10:48:33,990 INFO L78 Accepts]: Start accepts. Automaton has has 254 states, 253 states have (on average 3.984189723320158) internal successors, (1008), 254 states have internal predecessors, (1008), 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 505 [2025-03-04 10:48:33,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:48:33,993 INFO L225 Difference]: With dead ends: 1309 [2025-03-04 10:48:33,993 INFO L226 Difference]: Without dead ends: 1308 [2025-03-04 10:48:33,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1135 GetRequests, 883 SyntacticMatches, 0 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19469 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=16255, Invalid=48007, Unknown=0, NotChecked=0, Total=64262 [2025-03-04 10:48:33,996 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 1048 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:48:33,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 944 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:48:33,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2025-03-04 10:48:34,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1025. [2025-03-04 10:48:34,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1021 states have (on average 1.0959843290891282) internal successors, (1119), 1024 states have internal predecessors, (1119), 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) [2025-03-04 10:48:34,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1119 transitions. [2025-03-04 10:48:34,048 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1119 transitions. Word has length 505 [2025-03-04 10:48:34,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:48:34,048 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1119 transitions. [2025-03-04 10:48:34,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 254 states, 253 states have (on average 3.984189723320158) internal successors, (1008), 254 states have internal predecessors, (1008), 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) [2025-03-04 10:48:34,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1119 transitions. [2025-03-04 10:48:34,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2025-03-04 10:48:34,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:48:34,050 INFO L218 NwaCegarLoop]: trace histogram [64, 63, 63, 63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:48:34,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-04 10:48:34,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:34,251 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:48:34,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:48:34,251 INFO L85 PathProgramCache]: Analyzing trace with hash -88558870, now seen corresponding path program 6 times [2025-03-04 10:48:34,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:48:34,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144200477] [2025-03-04 10:48:34,252 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:48:34,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:48:34,263 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 513 statements into 64 equivalence classes. [2025-03-04 10:48:34,393 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 64 check-sat command(s) and asserted 513 of 513 statements. [2025-03-04 10:48:34,394 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 64 check-sat command(s) [2025-03-04 10:48:34,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:43,537 INFO L134 CoverageAnalysis]: Checked inductivity of 15750 backedges. 0 proven. 15750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:48:43,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:48:43,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144200477] [2025-03-04 10:48:43,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144200477] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:48:43,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845434406] [2025-03-04 10:48:43,538 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:48:43,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:43,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:48:43,539 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:48:43,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 10:48:43,590 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 513 statements into 64 equivalence classes. [2025-03-04 10:48:43,898 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 64 check-sat command(s) and asserted 513 of 513 statements. [2025-03-04 10:48:43,898 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 64 check-sat command(s) [2025-03-04 10:48:43,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:43,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 1170 conjuncts, 130 conjuncts are in the unsatisfiable core [2025-03-04 10:48:43,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:48:46,591 INFO L134 CoverageAnalysis]: Checked inductivity of 15750 backedges. 0 proven. 15750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:48:46,591 INFO L312 TraceCheckSpWp]: Computing backward predicates...