./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-restricted-15/b.06.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-restricted-15/b.06.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash cec1cb80cc444268f4d15edbfcfbc42fd6cec25bcc627308222b3bf585ff5fd0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:33:02,170 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:33:02,240 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-06 13:33:02,248 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:33:02,251 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:33:02,271 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:33:02,275 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:33:02,275 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:33:02,275 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:33:02,275 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:33:02,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:33:02,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:33:02,276 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:33:02,276 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:33:02,276 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:33:02,276 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:33:02,276 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 13:33:02,276 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:33:02,276 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:33:02,276 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 13:33:02,276 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:33:02,277 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 13:33:02,277 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 13:33:02,277 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:33:02,277 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 13:33:02,277 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:33:02,277 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:33:02,277 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:33:02,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:33:02,277 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:33:02,277 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:33:02,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:33:02,278 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:33:02,278 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:33:02,279 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 13:33:02,279 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 13:33:02,279 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:33:02,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:33:02,279 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:33:02,279 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:33:02,279 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:33:02,279 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:33:02,279 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cec1cb80cc444268f4d15edbfcfbc42fd6cec25bcc627308222b3bf585ff5fd0 [2025-02-06 13:33:02,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:33:02,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:33:02,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:33:02,543 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:33:02,544 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:33:02,544 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/b.06.c [2025-02-06 13:33:03,701 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ea2582ad/8f2879cce99a472e917db386eb222396/FLAG979ecc457 [2025-02-06 13:33:03,949 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:33:03,950 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/b.06.c [2025-02-06 13:33:03,962 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ea2582ad/8f2879cce99a472e917db386eb222396/FLAG979ecc457 [2025-02-06 13:33:04,263 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ea2582ad/8f2879cce99a472e917db386eb222396 [2025-02-06 13:33:04,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:33:04,265 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:33:04,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:33:04,266 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:33:04,269 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:33:04,270 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:33:04" (1/1) ... [2025-02-06 13:33:04,270 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@520cb6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:33:04, skipping insertion in model container [2025-02-06 13:33:04,270 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:33:04" (1/1) ... [2025-02-06 13:33:04,278 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:33:04,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:33:04,382 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:33:04,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:33:04,403 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:33:04,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:33:04 WrapperNode [2025-02-06 13:33:04,404 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:33:04,405 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:33:04,405 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:33:04,405 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:33:04,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:33:04" (1/1) ... [2025-02-06 13:33:04,414 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:33:04" (1/1) ... [2025-02-06 13:33:04,426 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2025-02-06 13:33:04,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:33:04,427 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:33:04,427 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:33:04,427 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:33:04,433 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:33:04" (1/1) ... [2025-02-06 13:33:04,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:33:04" (1/1) ... [2025-02-06 13:33:04,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:33:04" (1/1) ... [2025-02-06 13:33:04,439 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-06 13:33:04,440 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:33:04" (1/1) ... [2025-02-06 13:33:04,440 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:33:04" (1/1) ... [2025-02-06 13:33:04,441 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:33:04" (1/1) ... [2025-02-06 13:33:04,442 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:33:04" (1/1) ... [2025-02-06 13:33:04,442 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:33:04" (1/1) ... [2025-02-06 13:33:04,443 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:33:04" (1/1) ... [2025-02-06 13:33:04,444 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:33:04,444 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:33:04,445 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:33:04,445 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:33:04,445 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:33:04" (1/1) ... [2025-02-06 13:33:04,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:33:04,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:33:04,470 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 13:33:04,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 13:33:04,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:33:04,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:33:04,606 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:33:04,607 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:33:04,726 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-02-06 13:33:04,726 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:33:04,734 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:33:04,737 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:33:04,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:33:04 BoogieIcfgContainer [2025-02-06 13:33:04,738 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:33:04,739 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:33:04,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:33:04,746 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:33:04,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:33:04" (1/3) ... [2025-02-06 13:33:04,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@111406e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:33:04, skipping insertion in model container [2025-02-06 13:33:04,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:33:04" (2/3) ... [2025-02-06 13:33:04,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@111406e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:33:04, skipping insertion in model container [2025-02-06 13:33:04,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:33:04" (3/3) ... [2025-02-06 13:33:04,748 INFO L128 eAbstractionObserver]: Analyzing ICFG b.06.c [2025-02-06 13:33:04,769 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:33:04,770 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG b.06.c that has 1 procedures, 18 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2025-02-06 13:33:04,845 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:33:04,861 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;@563b6196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:33:04,861 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 13:33:04,864 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 17 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-02-06 13:33:04,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 13:33:04,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:33:04,875 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 13:33:04,875 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:33:04,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:33:04,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1445823, now seen corresponding path program 1 times [2025-02-06 13:33:04,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:33:04,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759462239] [2025-02-06 13:33:04,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:33:04,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:33:04,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 13:33:04,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 13:33:04,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:33:04,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:33:05,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:33:05,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:33:05,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759462239] [2025-02-06 13:33:05,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759462239] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:33:05,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:33:05,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:33:05,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286245369] [2025-02-06 13:33:05,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:33:05,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:33:05,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:33:05,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:33:05,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:33:05,086 INFO L87 Difference]: Start difference. First operand has 18 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 17 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-02-06 13:33:05,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:33:05,102 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2025-02-06 13:33:05,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:33:05,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-02-06 13:33:05,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:33:05,108 INFO L225 Difference]: With dead ends: 18 [2025-02-06 13:33:05,108 INFO L226 Difference]: Without dead ends: 14 [2025-02-06 13:33:05,109 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-02-06 13:33:05,111 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:33:05,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 24 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:33:05,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-02-06 13:33:05,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-02-06 13:33:05,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 13 states have internal predecessors, (14), 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-02-06 13:33:05,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-02-06 13:33:05,136 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 4 [2025-02-06 13:33:05,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:33:05,136 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-02-06 13:33:05,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-02-06 13:33:05,136 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-02-06 13:33:05,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 13:33:05,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:33:05,137 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 13:33:05,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:33:05,137 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:33:05,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:33:05,139 INFO L85 PathProgramCache]: Analyzing trace with hash 44820494, now seen corresponding path program 1 times [2025-02-06 13:33:05,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:33:05,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484806488] [2025-02-06 13:33:05,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:33:05,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:33:05,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:33:05,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:33:05,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:33:05,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:33:05,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:33:05,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:33:05,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484806488] [2025-02-06 13:33:05,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484806488] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:33:05,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:33:05,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:33:05,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510491434] [2025-02-06 13:33:05,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:33:05,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:33:05,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:33:05,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:33:05,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:33:05,179 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-02-06 13:33:05,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:33:05,189 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-02-06 13:33:05,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:33:05,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-02-06 13:33:05,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:33:05,190 INFO L225 Difference]: With dead ends: 14 [2025-02-06 13:33:05,190 INFO L226 Difference]: Without dead ends: 13 [2025-02-06 13:33:05,190 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-02-06 13:33:05,193 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:33:05,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 11 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:33:05,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-02-06 13:33:05,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-02-06 13:33:05,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 12 states have internal predecessors, (13), 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-02-06 13:33:05,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2025-02-06 13:33:05,194 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 5 [2025-02-06 13:33:05,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:33:05,196 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2025-02-06 13:33:05,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-02-06 13:33:05,196 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2025-02-06 13:33:05,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 13:33:05,196 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:33:05,196 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 13:33:05,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:33:05,196 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:33:05,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:33:05,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1389435293, now seen corresponding path program 1 times [2025-02-06 13:33:05,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:33:05,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152328626] [2025-02-06 13:33:05,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:33:05,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:33:05,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 13:33:05,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 13:33:05,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:33:05,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:33:05,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:33:05,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:33:05,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152328626] [2025-02-06 13:33:05,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152328626] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:33:05,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:33:05,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:33:05,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790832930] [2025-02-06 13:33:05,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:33:05,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:33:05,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:33:05,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:33:05,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:33:05,232 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-02-06 13:33:05,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:33:05,245 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2025-02-06 13:33:05,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:33:05,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-02-06 13:33:05,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:33:05,247 INFO L225 Difference]: With dead ends: 13 [2025-02-06 13:33:05,247 INFO L226 Difference]: Without dead ends: 12 [2025-02-06 13:33:05,247 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-02-06 13:33:05,248 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:33:05,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 14 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:33:05,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-02-06 13:33:05,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-02-06 13:33:05,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 11 states have internal predecessors, (12), 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-02-06 13:33:05,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-02-06 13:33:05,252 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 6 [2025-02-06 13:33:05,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:33:05,253 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-02-06 13:33:05,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-02-06 13:33:05,253 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-02-06 13:33:05,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 13:33:05,253 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:33:05,253 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:33:05,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 13:33:05,254 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:33:05,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:33:05,255 INFO L85 PathProgramCache]: Analyzing trace with hash 122821100, now seen corresponding path program 1 times [2025-02-06 13:33:05,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:33:05,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117360571] [2025-02-06 13:33:05,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:33:05,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:33:05,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 13:33:05,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 13:33:05,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:33:05,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:33:05,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:33:05,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:33:05,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117360571] [2025-02-06 13:33:05,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117360571] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:33:05,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:33:05,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:33:05,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539540553] [2025-02-06 13:33:05,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:33:05,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:33:05,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:33:05,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:33:05,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:33:05,294 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-02-06 13:33:05,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:33:05,303 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2025-02-06 13:33:05,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:33:05,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-02-06 13:33:05,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:33:05,304 INFO L225 Difference]: With dead ends: 12 [2025-02-06 13:33:05,304 INFO L226 Difference]: Without dead ends: 11 [2025-02-06 13:33:05,304 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-02-06 13:33:05,304 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:33:05,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 9 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:33:05,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-02-06 13:33:05,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-02-06 13:33:05,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 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-02-06 13:33:05,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-02-06 13:33:05,309 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2025-02-06 13:33:05,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:33:05,309 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-02-06 13:33:05,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-02-06 13:33:05,309 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-02-06 13:33:05,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 13:33:05,310 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:33:05,311 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:33:05,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 13:33:05,311 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:33:05,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:33:05,311 INFO L85 PathProgramCache]: Analyzing trace with hash -487513221, now seen corresponding path program 1 times [2025-02-06 13:33:05,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:33:05,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567816116] [2025-02-06 13:33:05,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:33:05,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:33:05,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 13:33:05,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 13:33:05,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:33:05,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:33:05,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:33:05,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:33:05,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567816116] [2025-02-06 13:33:05,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567816116] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:33:05,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:33:05,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:33:05,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40839557] [2025-02-06 13:33:05,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:33:05,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:33:05,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:33:05,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:33:05,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:33:05,355 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-02-06 13:33:05,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:33:05,365 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2025-02-06 13:33:05,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:33:05,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-02-06 13:33:05,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:33:05,365 INFO L225 Difference]: With dead ends: 11 [2025-02-06 13:33:05,365 INFO L226 Difference]: Without dead ends: 10 [2025-02-06 13:33:05,365 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-02-06 13:33:05,366 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:33:05,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 8 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:33:05,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-02-06 13:33:05,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-02-06 13:33:05,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 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-02-06 13:33:05,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2025-02-06 13:33:05,368 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2025-02-06 13:33:05,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:33:05,368 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2025-02-06 13:33:05,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-02-06 13:33:05,368 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2025-02-06 13:33:05,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 13:33:05,368 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:33:05,368 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:33:05,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 13:33:05,368 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:33:05,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:33:05,371 INFO L85 PathProgramCache]: Analyzing trace with hash 2066959306, now seen corresponding path program 1 times [2025-02-06 13:33:05,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:33:05,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387880733] [2025-02-06 13:33:05,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:33:05,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:33:05,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 13:33:05,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 13:33:05,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:33:05,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:33:05,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:33:05,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:33:05,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387880733] [2025-02-06 13:33:05,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387880733] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:33:05,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:33:05,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:33:05,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49076144] [2025-02-06 13:33:05,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:33:05,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:33:05,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:33:05,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:33:05,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:33:05,411 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-02-06 13:33:05,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:33:05,422 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2025-02-06 13:33:05,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:33:05,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-02-06 13:33:05,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:33:05,425 INFO L225 Difference]: With dead ends: 18 [2025-02-06 13:33:05,425 INFO L226 Difference]: Without dead ends: 17 [2025-02-06 13:33:05,425 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-02-06 13:33:05,426 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:33:05,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:33:05,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-02-06 13:33:05,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-02-06 13:33:05,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 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-02-06 13:33:05,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2025-02-06 13:33:05,428 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 9 [2025-02-06 13:33:05,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:33:05,430 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2025-02-06 13:33:05,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-02-06 13:33:05,430 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2025-02-06 13:33:05,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 13:33:05,431 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:33:05,431 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-02-06 13:33:05,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 13:33:05,431 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:33:05,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:33:05,431 INFO L85 PathProgramCache]: Analyzing trace with hash -844481087, now seen corresponding path program 1 times [2025-02-06 13:33:05,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:33:05,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086283799] [2025-02-06 13:33:05,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:33:05,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:33:05,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 13:33:05,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 13:33:05,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:33:05,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:33:05,503 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:33:05,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:33:05,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086283799] [2025-02-06 13:33:05,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086283799] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:33:05,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309921647] [2025-02-06 13:33:05,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:33:05,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:33:05,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:33:05,506 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:33:05,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 13:33:05,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 13:33:05,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 13:33:05,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:33:05,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:33:05,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 13:33:05,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:33:05,608 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:33:05,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:33:05,668 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:33:05,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309921647] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:33:05,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:33:05,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-02-06 13:33:05,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613877322] [2025-02-06 13:33:05,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:33:05,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:33:05,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:33:05,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:33:05,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:33:05,669 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 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-02-06 13:33:05,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:33:05,702 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2025-02-06 13:33:05,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:33:05,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 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) Word has length 16 [2025-02-06 13:33:05,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:33:05,705 INFO L225 Difference]: With dead ends: 39 [2025-02-06 13:33:05,705 INFO L226 Difference]: Without dead ends: 38 [2025-02-06 13:33:05,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 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-02-06 13:33:05,706 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:33:05,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:33:05,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-06 13:33:05,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-02-06 13:33:05,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 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-02-06 13:33:05,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2025-02-06 13:33:05,714 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 16 [2025-02-06 13:33:05,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:33:05,714 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2025-02-06 13:33:05,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 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-02-06 13:33:05,714 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2025-02-06 13:33:05,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-06 13:33:05,715 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:33:05,715 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1] [2025-02-06 13:33:05,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 13:33:05,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:33:05,919 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:33:05,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:33:05,919 INFO L85 PathProgramCache]: Analyzing trace with hash -794432502, now seen corresponding path program 2 times [2025-02-06 13:33:05,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:33:05,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711732917] [2025-02-06 13:33:05,920 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:33:05,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:33:05,948 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-06 13:33:05,980 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 13:33:05,980 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:33:05,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:33:06,104 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:33:06,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:33:06,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711732917] [2025-02-06 13:33:06,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711732917] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:33:06,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689164883] [2025-02-06 13:33:06,104 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:33:06,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:33:06,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:33:06,109 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:33:06,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 13:33:06,134 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-06 13:33:06,146 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 13:33:06,147 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:33:06,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:33:06,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 13:33:06,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:33:06,197 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:33:06,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:33:06,317 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:33:06,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689164883] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:33:06,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:33:06,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-02-06 13:33:06,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575383815] [2025-02-06 13:33:06,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:33:06,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 13:33:06,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:33:06,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 13:33:06,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:33:06,319 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 12 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-02-06 13:33:06,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:33:06,360 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2025-02-06 13:33:06,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 13:33:06,360 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 12 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) Word has length 37 [2025-02-06 13:33:06,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:33:06,361 INFO L225 Difference]: With dead ends: 81 [2025-02-06 13:33:06,361 INFO L226 Difference]: Without dead ends: 80 [2025-02-06 13:33:06,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:33:06,362 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:33:06,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:33:06,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-06 13:33:06,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-02-06 13:33:06,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.0126582278481013) internal successors, (80), 79 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-02-06 13:33:06,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2025-02-06 13:33:06,369 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 37 [2025-02-06 13:33:06,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:33:06,369 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2025-02-06 13:33:06,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 12 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-02-06 13:33:06,370 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2025-02-06 13:33:06,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-06 13:33:06,371 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:33:06,371 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 1, 1, 1] [2025-02-06 13:33:06,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 13:33:06,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:33:06,572 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:33:06,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:33:06,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1001388138, now seen corresponding path program 3 times [2025-02-06 13:33:06,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:33:06,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911917925] [2025-02-06 13:33:06,574 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:33:06,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:33:06,584 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 79 statements into 11 equivalence classes. [2025-02-06 13:33:06,599 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 79 of 79 statements. [2025-02-06 13:33:06,599 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-06 13:33:06,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:33:06,930 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:33:06,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:33:06,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911917925] [2025-02-06 13:33:06,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911917925] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:33:06,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549352173] [2025-02-06 13:33:06,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:33:06,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:33:06,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:33:06,934 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:33:06,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 13:33:06,968 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 79 statements into 11 equivalence classes. [2025-02-06 13:33:06,994 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 79 of 79 statements. [2025-02-06 13:33:06,994 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-06 13:33:06,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:33:06,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 13:33:06,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:33:07,089 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:33:07,090 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:33:07,344 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:33:07,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549352173] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:33:07,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:33:07,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-02-06 13:33:07,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804600006] [2025-02-06 13:33:07,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:33:07,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 13:33:07,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:33:07,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 13:33:07,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-02-06 13:33:07,346 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand has 24 states, 23 states have (on average 6.826086956521739) internal successors, (157), 24 states have internal predecessors, (157), 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-02-06 13:33:07,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:33:07,412 INFO L93 Difference]: Finished difference Result 165 states and 176 transitions. [2025-02-06 13:33:07,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 13:33:07,413 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 6.826086956521739) internal successors, (157), 24 states have internal predecessors, (157), 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 79 [2025-02-06 13:33:07,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:33:07,414 INFO L225 Difference]: With dead ends: 165 [2025-02-06 13:33:07,414 INFO L226 Difference]: Without dead ends: 164 [2025-02-06 13:33:07,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 146 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-02-06 13:33:07,415 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:33:07,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:33:07,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-02-06 13:33:07,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-02-06 13:33:07,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 1.0061349693251533) internal successors, (164), 163 states have internal predecessors, (164), 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-02-06 13:33:07,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2025-02-06 13:33:07,425 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 79 [2025-02-06 13:33:07,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:33:07,425 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2025-02-06 13:33:07,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 6.826086956521739) internal successors, (157), 24 states have internal predecessors, (157), 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-02-06 13:33:07,426 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2025-02-06 13:33:07,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 13:33:07,429 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:33:07,429 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 22, 1, 1, 1] [2025-02-06 13:33:07,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 13:33:07,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:33:07,630 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:33:07,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:33:07,631 INFO L85 PathProgramCache]: Analyzing trace with hash -2083935958, now seen corresponding path program 4 times [2025-02-06 13:33:07,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:33:07,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236461003] [2025-02-06 13:33:07,631 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 13:33:07,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:33:07,646 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 163 statements into 2 equivalence classes. [2025-02-06 13:33:07,666 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 13:33:07,666 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 13:33:07,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:33:08,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1771 backedges. 0 proven. 1771 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:33:08,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:33:08,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236461003] [2025-02-06 13:33:08,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236461003] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:33:08,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666248799] [2025-02-06 13:33:08,397 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 13:33:08,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:33:08,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:33:08,402 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:33:08,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 13:33:08,436 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 163 statements into 2 equivalence classes. [2025-02-06 13:33:08,490 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 13:33:08,491 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 13:33:08,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:33:08,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 13:33:08,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:33:08,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1771 backedges. 0 proven. 1771 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:33:08,720 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:33:09,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1771 backedges. 0 proven. 1771 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:33:09,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666248799] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:33:09,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:33:09,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-02-06 13:33:09,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861381867] [2025-02-06 13:33:09,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:33:09,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-06 13:33:09,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:33:09,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-06 13:33:09,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-02-06 13:33:09,511 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand has 48 states, 47 states have (on average 6.914893617021277) internal successors, (325), 48 states have internal predecessors, (325), 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-02-06 13:33:09,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:33:09,682 INFO L93 Difference]: Finished difference Result 333 states and 356 transitions. [2025-02-06 13:33:09,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-02-06 13:33:09,683 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 6.914893617021277) internal successors, (325), 48 states have internal predecessors, (325), 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 163 [2025-02-06 13:33:09,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:33:09,684 INFO L225 Difference]: With dead ends: 333 [2025-02-06 13:33:09,684 INFO L226 Difference]: Without dead ends: 332 [2025-02-06 13:33:09,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-02-06 13:33:09,688 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:33:09,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 245 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:33:09,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-02-06 13:33:09,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-02-06 13:33:09,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.0030211480362539) internal successors, (332), 331 states have internal predecessors, (332), 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-02-06 13:33:09,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 332 transitions. [2025-02-06 13:33:09,717 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 332 transitions. Word has length 163 [2025-02-06 13:33:09,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:33:09,718 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 332 transitions. [2025-02-06 13:33:09,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 6.914893617021277) internal successors, (325), 48 states have internal predecessors, (325), 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-02-06 13:33:09,718 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 332 transitions. [2025-02-06 13:33:09,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-02-06 13:33:09,725 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:33:09,725 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 46, 1, 1, 1] [2025-02-06 13:33:09,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 13:33:09,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 13:33:09,926 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:33:09,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:33:09,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1257990826, now seen corresponding path program 5 times [2025-02-06 13:33:09,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:33:09,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566877456] [2025-02-06 13:33:09,927 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 13:33:09,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:33:09,945 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 331 statements into 47 equivalence classes. [2025-02-06 13:33:10,114 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 331 of 331 statements. [2025-02-06 13:33:10,114 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-02-06 13:33:10,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:33:12,299 INFO L134 CoverageAnalysis]: Checked inductivity of 7567 backedges. 0 proven. 7567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:33:12,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:33:12,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566877456] [2025-02-06 13:33:12,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566877456] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:33:12,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112487427] [2025-02-06 13:33:12,299 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 13:33:12,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:33:12,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:33:12,301 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:33:12,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 13:33:12,330 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 331 statements into 47 equivalence classes. [2025-02-06 13:33:12,412 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 331 of 331 statements. [2025-02-06 13:33:12,412 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-02-06 13:33:12,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:33:12,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-06 13:33:12,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:33:12,736 INFO L134 CoverageAnalysis]: Checked inductivity of 7567 backedges. 0 proven. 7567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:33:12,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:33:15,283 INFO L134 CoverageAnalysis]: Checked inductivity of 7567 backedges. 0 proven. 7567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:33:15,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112487427] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:33:15,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:33:15,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2025-02-06 13:33:15,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641045146] [2025-02-06 13:33:15,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:33:15,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-02-06 13:33:15,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:33:15,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-02-06 13:33:15,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-02-06 13:33:15,293 INFO L87 Difference]: Start difference. First operand 332 states and 332 transitions. Second operand has 96 states, 95 states have (on average 6.957894736842105) internal successors, (661), 96 states have internal predecessors, (661), 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-02-06 13:33:15,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:33:15,617 INFO L93 Difference]: Finished difference Result 669 states and 716 transitions. [2025-02-06 13:33:15,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-02-06 13:33:15,617 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 6.957894736842105) internal successors, (661), 96 states have internal predecessors, (661), 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 331 [2025-02-06 13:33:15,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:33:15,621 INFO L225 Difference]: With dead ends: 669 [2025-02-06 13:33:15,623 INFO L226 Difference]: Without dead ends: 668 [2025-02-06 13:33:15,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 614 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-02-06 13:33:15,626 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 13:33:15,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 482 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 13:33:15,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2025-02-06 13:33:15,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 668. [2025-02-06 13:33:15,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 667 states have (on average 1.0014992503748126) internal successors, (668), 667 states have internal predecessors, (668), 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-02-06 13:33:15,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 668 transitions. [2025-02-06 13:33:15,650 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 668 transitions. Word has length 331 [2025-02-06 13:33:15,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:33:15,654 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 668 transitions. [2025-02-06 13:33:15,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 6.957894736842105) internal successors, (661), 96 states have internal predecessors, (661), 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-02-06 13:33:15,655 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 668 transitions. [2025-02-06 13:33:15,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2025-02-06 13:33:15,666 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:33:15,666 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 95, 95, 95, 94, 1, 1, 1] [2025-02-06 13:33:15,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 13:33:15,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 13:33:15,870 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:33:15,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:33:15,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1889037738, now seen corresponding path program 6 times [2025-02-06 13:33:15,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:33:15,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753312326] [2025-02-06 13:33:15,871 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 13:33:15,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:33:15,889 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 667 statements into 95 equivalence classes. [2025-02-06 13:33:16,031 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 667 of 667 statements. [2025-02-06 13:33:16,032 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-02-06 13:33:16,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:33:21,933 INFO L134 CoverageAnalysis]: Checked inductivity of 31255 backedges. 0 proven. 31255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:33:21,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:33:21,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753312326] [2025-02-06 13:33:21,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753312326] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:33:21,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587794921] [2025-02-06 13:33:21,934 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 13:33:21,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:33:21,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:33:21,937 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:33:21,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 13:33:22,000 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 667 statements into 95 equivalence classes. [2025-02-06 13:33:22,223 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 667 of 667 statements. [2025-02-06 13:33:22,223 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-02-06 13:33:22,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:33:22,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 1337 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-02-06 13:33:22,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:33:22,961 INFO L134 CoverageAnalysis]: Checked inductivity of 31255 backedges. 0 proven. 31255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:33:22,961 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:33:31,418 INFO L134 CoverageAnalysis]: Checked inductivity of 31255 backedges. 0 proven. 31255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:33:31,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587794921] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:33:31,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:33:31,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2025-02-06 13:33:31,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952377140] [2025-02-06 13:33:31,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:33:31,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2025-02-06 13:33:31,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:33:31,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-02-06 13:33:31,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-02-06 13:33:31,433 INFO L87 Difference]: Start difference. First operand 668 states and 668 transitions. Second operand has 192 states, 191 states have (on average 6.979057591623037) internal successors, (1333), 192 states have internal predecessors, (1333), 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-02-06 13:33:32,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:33:32,316 INFO L93 Difference]: Finished difference Result 1341 states and 1436 transitions. [2025-02-06 13:33:32,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-02-06 13:33:32,316 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 191 states have (on average 6.979057591623037) internal successors, (1333), 192 states have internal predecessors, (1333), 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 667 [2025-02-06 13:33:32,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:33:32,320 INFO L225 Difference]: With dead ends: 1341 [2025-02-06 13:33:32,321 INFO L226 Difference]: Without dead ends: 1340 [2025-02-06 13:33:32,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1428 GetRequests, 1238 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-02-06 13:33:32,324 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 13:33:32,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 962 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 13:33:32,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2025-02-06 13:33:32,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1340. [2025-02-06 13:33:32,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1340 states, 1339 states have (on average 1.0007468259895445) internal successors, (1340), 1339 states have internal predecessors, (1340), 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-02-06 13:33:32,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1340 transitions. [2025-02-06 13:33:32,363 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1340 transitions. Word has length 667 [2025-02-06 13:33:32,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:33:32,365 INFO L471 AbstractCegarLoop]: Abstraction has 1340 states and 1340 transitions. [2025-02-06 13:33:32,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 191 states have (on average 6.979057591623037) internal successors, (1333), 192 states have internal predecessors, (1333), 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-02-06 13:33:32,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1340 transitions. [2025-02-06 13:33:32,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1340 [2025-02-06 13:33:32,397 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:33:32,397 INFO L218 NwaCegarLoop]: trace histogram [191, 191, 191, 191, 191, 191, 190, 1, 1, 1] [2025-02-06 13:33:32,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 13:33:32,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-06 13:33:32,603 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:33:32,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:33:32,604 INFO L85 PathProgramCache]: Analyzing trace with hash 850949034, now seen corresponding path program 7 times [2025-02-06 13:33:32,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:33:32,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624026266] [2025-02-06 13:33:32,604 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 13:33:32,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:33:32,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1339 statements into 1 equivalence classes. [2025-02-06 13:33:32,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1339 of 1339 statements. [2025-02-06 13:33:32,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:33:32,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:34:00,116 INFO L134 CoverageAnalysis]: Checked inductivity of 127015 backedges. 0 proven. 127015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:34:00,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:34:00,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624026266] [2025-02-06 13:34:00,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624026266] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:34:00,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578213556] [2025-02-06 13:34:00,117 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 13:34:00,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:34:00,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:34:00,119 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:34:00,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 13:34:00,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1339 statements into 1 equivalence classes. [2025-02-06 13:34:00,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1339 of 1339 statements. [2025-02-06 13:34:00,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:34:00,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:34:00,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 2681 conjuncts, 192 conjuncts are in the unsatisfiable core [2025-02-06 13:34:00,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:34:01,628 INFO L134 CoverageAnalysis]: Checked inductivity of 127015 backedges. 0 proven. 127015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:34:01,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:34:35,601 INFO L134 CoverageAnalysis]: Checked inductivity of 127015 backedges. 0 proven. 127015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:34:35,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578213556] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:34:35,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:34:35,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [192, 192, 192] total 383 [2025-02-06 13:34:35,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501486301] [2025-02-06 13:34:35,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:34:35,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 384 states [2025-02-06 13:34:35,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:34:35,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 384 interpolants. [2025-02-06 13:34:35,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73536, Invalid=73536, Unknown=0, NotChecked=0, Total=147072 [2025-02-06 13:34:35,638 INFO L87 Difference]: Start difference. First operand 1340 states and 1340 transitions. Second operand has 384 states, 383 states have (on average 6.989556135770235) internal successors, (2677), 384 states have internal predecessors, (2677), 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)