./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive-simple/id2_i5_o5-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d 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/recursive-simple/id2_i5_o5-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-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 32bit --witnessprinter.graph.data.programhash 5a6f0ceb44f91fbf2c30fb7a6cf4ec4645c0e639d55219bc8a5d1521d1ed7589 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 10:01:22,129 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 10:01:22,174 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 10:01:22,180 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 10:01:22,180 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 10:01:22,205 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 10:01:22,206 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 10:01:22,206 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 10:01:22,206 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 10:01:22,206 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 10:01:22,206 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 10:01:22,206 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 10:01:22,207 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 10:01:22,207 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 10:01:22,207 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 10:01:22,207 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 10:01:22,207 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 10:01:22,207 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 10:01:22,207 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 10:01:22,207 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 10:01:22,207 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 10:01:22,207 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 10:01:22,207 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 10:01:22,207 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 10:01:22,207 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 10:01:22,207 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 10:01:22,207 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 10:01:22,207 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 10:01:22,207 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 10:01:22,207 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 10:01:22,207 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 10:01:22,208 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 10:01:22,208 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 10:01:22,208 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 10:01:22,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 10:01:22,208 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 10:01:22,208 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 10:01:22,208 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 10:01:22,208 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 10:01:22,208 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 10:01:22,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 10:01:22,208 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 10:01:22,208 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 10:01:22,208 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 10:01:22,208 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 10:01:22,208 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5a6f0ceb44f91fbf2c30fb7a6cf4ec4645c0e639d55219bc8a5d1521d1ed7589 [2025-02-08 10:01:22,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 10:01:22,444 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 10:01:22,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 10:01:22,446 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 10:01:22,446 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 10:01:22,447 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id2_i5_o5-1.c [2025-02-08 10:01:23,608 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d56c0484b/268d2ed21dc44891981ee55b0e6fee5b/FLAG7c9864e25 [2025-02-08 10:01:23,915 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 10:01:23,915 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive-simple/id2_i5_o5-1.c [2025-02-08 10:01:23,941 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d56c0484b/268d2ed21dc44891981ee55b0e6fee5b/FLAG7c9864e25 [2025-02-08 10:01:24,177 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d56c0484b/268d2ed21dc44891981ee55b0e6fee5b [2025-02-08 10:01:24,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 10:01:24,181 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 10:01:24,182 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 10:01:24,182 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 10:01:24,185 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 10:01:24,185 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 10:01:24" (1/1) ... [2025-02-08 10:01:24,186 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c86681a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:01:24, skipping insertion in model container [2025-02-08 10:01:24,186 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 10:01:24" (1/1) ... [2025-02-08 10:01:24,194 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 10:01:24,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 10:01:24,294 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 10:01:24,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 10:01:24,312 INFO L204 MainTranslator]: Completed translation [2025-02-08 10:01:24,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:01:24 WrapperNode [2025-02-08 10:01:24,313 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 10:01:24,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 10:01:24,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 10:01:24,314 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 10:01:24,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:01:24" (1/1) ... [2025-02-08 10:01:24,323 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:01:24" (1/1) ... [2025-02-08 10:01:24,332 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 19 [2025-02-08 10:01:24,333 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 10:01:24,333 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 10:01:24,334 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 10:01:24,334 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 10:01:24,338 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:01:24" (1/1) ... [2025-02-08 10:01:24,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:01:24" (1/1) ... [2025-02-08 10:01:24,339 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:01:24" (1/1) ... [2025-02-08 10:01:24,349 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 10:01:24,349 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:01:24" (1/1) ... [2025-02-08 10:01:24,349 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:01:24" (1/1) ... [2025-02-08 10:01:24,351 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:01:24" (1/1) ... [2025-02-08 10:01:24,351 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:01:24" (1/1) ... [2025-02-08 10:01:24,351 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:01:24" (1/1) ... [2025-02-08 10:01:24,352 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:01:24" (1/1) ... [2025-02-08 10:01:24,353 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 10:01:24,354 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 10:01:24,354 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 10:01:24,354 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 10:01:24,355 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:01:24" (1/1) ... [2025-02-08 10:01:24,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 10:01:24,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:01:24,380 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-08 10:01:24,387 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-08 10:01:24,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 10:01:24,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 10:01:24,403 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2025-02-08 10:01:24,403 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2025-02-08 10:01:24,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 10:01:24,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 10:01:24,404 INFO L130 BoogieDeclarations]: Found specification of procedure id [2025-02-08 10:01:24,404 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2025-02-08 10:01:24,445 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 10:01:24,446 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 10:01:24,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L16: havoc #t~ret5; [2025-02-08 10:01:24,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L11: havoc #t~ret4; [2025-02-08 10:01:24,535 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-02-08 10:01:24,536 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 10:01:24,545 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 10:01:24,546 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 10:01:24,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 10:01:24 BoogieIcfgContainer [2025-02-08 10:01:24,547 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 10:01:24,552 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 10:01:24,552 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 10:01:24,555 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 10:01:24,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 10:01:24" (1/3) ... [2025-02-08 10:01:24,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@387de079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 10:01:24, skipping insertion in model container [2025-02-08 10:01:24,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:01:24" (2/3) ... [2025-02-08 10:01:24,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@387de079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 10:01:24, skipping insertion in model container [2025-02-08 10:01:24,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 10:01:24" (3/3) ... [2025-02-08 10:01:24,560 INFO L128 eAbstractionObserver]: Analyzing ICFG id2_i5_o5-1.c [2025-02-08 10:01:24,569 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 10:01:24,571 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG id2_i5_o5-1.c that has 3 procedures, 35 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-02-08 10:01:24,599 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 10:01:24,606 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;@3919ae93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 10:01:24,606 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-08 10:01:24,608 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 10:01:24,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 10:01:24,612 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:01:24,612 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 10:01:24,612 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 10:01:24,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:01:24,615 INFO L85 PathProgramCache]: Analyzing trace with hash 48296141, now seen corresponding path program 1 times [2025-02-08 10:01:24,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:01:24,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456991986] [2025-02-08 10:01:24,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:01:24,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:01:24,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 10:01:24,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 10:01:24,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:01:24,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:01:24,773 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-08 10:01:24,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:01:24,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456991986] [2025-02-08 10:01:24,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456991986] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:01:24,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:01:24,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 10:01:24,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832913438] [2025-02-08 10:01:24,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:01:24,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 10:01:24,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:01:24,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 10:01:24,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 10:01:24,796 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:01:24,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:01:24,863 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2025-02-08 10:01:24,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 10:01:24,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 10:01:24,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:01:24,872 INFO L225 Difference]: With dead ends: 56 [2025-02-08 10:01:24,872 INFO L226 Difference]: Without dead ends: 41 [2025-02-08 10:01:24,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:01:24,875 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 21 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 10:01:24,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 120 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:01:24,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-08 10:01:24,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2025-02-08 10:01:24,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.5) internal successors, (36), 31 states have internal predecessors, (36), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 10:01:24,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2025-02-08 10:01:24,897 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 5 [2025-02-08 10:01:24,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:01:24,897 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2025-02-08 10:01:24,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:01:24,898 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2025-02-08 10:01:24,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 10:01:24,898 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:01:24,898 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 10:01:24,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 10:01:24,898 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 10:01:24,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:01:24,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1497180370, now seen corresponding path program 1 times [2025-02-08 10:01:24,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:01:24,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469603789] [2025-02-08 10:01:24,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:01:24,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:01:24,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 10:01:24,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 10:01:24,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:01:24,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:01:24,936 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-08 10:01:24,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:01:24,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469603789] [2025-02-08 10:01:24,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469603789] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:01:24,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:01:24,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 10:01:24,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65561715] [2025-02-08 10:01:24,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:01:24,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 10:01:24,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:01:24,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 10:01:24,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 10:01:24,938 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:01:24,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:01:24,965 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2025-02-08 10:01:24,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 10:01:24,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 10:01:24,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:01:24,965 INFO L225 Difference]: With dead ends: 41 [2025-02-08 10:01:24,966 INFO L226 Difference]: Without dead ends: 40 [2025-02-08 10:01:24,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:01:24,966 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 13 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 10:01:24,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 109 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:01:24,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-02-08 10:01:24,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-02-08 10:01:24,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 31 states have internal predecessors, (35), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 10:01:24,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2025-02-08 10:01:24,975 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 6 [2025-02-08 10:01:24,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:01:24,975 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2025-02-08 10:01:24,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:01:24,975 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2025-02-08 10:01:24,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 10:01:24,975 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:01:24,978 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:01:24,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 10:01:24,979 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting id2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 10:01:24,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:01:24,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1308807725, now seen corresponding path program 1 times [2025-02-08 10:01:24,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:01:24,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907760523] [2025-02-08 10:01:24,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:01:24,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:01:24,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 10:01:24,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 10:01:24,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:01:24,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:01:25,043 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-08 10:01:25,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:01:25,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907760523] [2025-02-08 10:01:25,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907760523] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:01:25,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:01:25,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:01:25,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482808515] [2025-02-08 10:01:25,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:01:25,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:01:25,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:01:25,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:01:25,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:01:25,045 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:01:25,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:01:25,102 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2025-02-08 10:01:25,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:01:25,102 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-08 10:01:25,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:01:25,103 INFO L225 Difference]: With dead ends: 61 [2025-02-08 10:01:25,103 INFO L226 Difference]: Without dead ends: 53 [2025-02-08 10:01:25,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-08 10:01:25,104 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 31 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 10:01:25,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 132 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:01:25,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-08 10:01:25,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2025-02-08 10:01:25,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.4375) internal successors, (46), 39 states have internal predecessors, (46), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 10:01:25,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2025-02-08 10:01:25,109 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 10 [2025-02-08 10:01:25,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:01:25,109 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2025-02-08 10:01:25,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:01:25,109 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2025-02-08 10:01:25,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 10:01:25,109 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:01:25,109 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:01:25,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 10:01:25,110 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 10:01:25,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:01:25,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1918333834, now seen corresponding path program 1 times [2025-02-08 10:01:25,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:01:25,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348126854] [2025-02-08 10:01:25,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:01:25,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:01:25,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 10:01:25,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 10:01:25,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:01:25,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:01:25,175 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-08 10:01:25,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:01:25,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348126854] [2025-02-08 10:01:25,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348126854] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:01:25,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:01:25,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:01:25,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332205106] [2025-02-08 10:01:25,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:01:25,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:01:25,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:01:25,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:01:25,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:01:25,176 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 7 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:01:25,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:01:25,253 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2025-02-08 10:01:25,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:01:25,253 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-08 10:01:25,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:01:25,254 INFO L225 Difference]: With dead ends: 52 [2025-02-08 10:01:25,254 INFO L226 Difference]: Without dead ends: 50 [2025-02-08 10:01:25,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-08 10:01:25,255 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 38 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:01:25,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 74 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:01:25,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-08 10:01:25,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2025-02-08 10:01:25,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.34375) internal successors, (43), 37 states have internal predecessors, (43), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 10:01:25,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2025-02-08 10:01:25,260 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 11 [2025-02-08 10:01:25,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:01:25,260 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2025-02-08 10:01:25,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:01:25,260 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2025-02-08 10:01:25,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 10:01:25,260 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:01:25,260 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:01:25,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 10:01:25,261 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 10:01:25,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:01:25,261 INFO L85 PathProgramCache]: Analyzing trace with hash 889496401, now seen corresponding path program 1 times [2025-02-08 10:01:25,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:01:25,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140572965] [2025-02-08 10:01:25,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:01:25,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:01:25,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 10:01:25,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 10:01:25,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:01:25,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:01:25,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:01:25,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:01:25,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140572965] [2025-02-08 10:01:25,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140572965] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:01:25,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086492939] [2025-02-08 10:01:25,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:01:25,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:01:25,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:01:25,405 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-08 10:01:25,406 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-08 10:01:25,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 10:01:25,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 10:01:25,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:01:25,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:01:25,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 10:01:25,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:01:25,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:01:25,521 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 10:01:25,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:01:25,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086492939] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 10:01:25,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 10:01:25,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-02-08 10:01:25,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603740420] [2025-02-08 10:01:25,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 10:01:25,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 10:01:25,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:01:25,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 10:01:25,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-02-08 10:01:25,744 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 16 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 9 states have internal predecessors, (24), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:01:25,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:01:25,870 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2025-02-08 10:01:25,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 10:01:25,870 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 9 states have internal predecessors, (24), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-08 10:01:25,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:01:25,871 INFO L225 Difference]: With dead ends: 108 [2025-02-08 10:01:25,871 INFO L226 Difference]: Without dead ends: 92 [2025-02-08 10:01:25,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2025-02-08 10:01:25,872 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 132 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:01:25,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 200 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:01:25,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-08 10:01:25,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 76. [2025-02-08 10:01:25,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 61 states have internal predecessors, (75), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 10:01:25,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2025-02-08 10:01:25,878 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 15 [2025-02-08 10:01:25,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:01:25,879 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2025-02-08 10:01:25,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 9 states have internal predecessors, (24), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:01:25,879 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2025-02-08 10:01:25,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 10:01:25,879 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:01:25,879 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:01:25,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 10:01:26,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:01:26,080 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 10:01:26,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:01:26,080 INFO L85 PathProgramCache]: Analyzing trace with hash 759621333, now seen corresponding path program 1 times [2025-02-08 10:01:26,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:01:26,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388798228] [2025-02-08 10:01:26,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:01:26,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:01:26,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 10:01:26,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 10:01:26,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:01:26,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:01:26,115 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 10:01:26,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:01:26,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388798228] [2025-02-08 10:01:26,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388798228] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:01:26,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:01:26,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 10:01:26,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750718944] [2025-02-08 10:01:26,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:01:26,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 10:01:26,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:01:26,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 10:01:26,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 10:01:26,117 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:01:26,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:01:26,130 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2025-02-08 10:01:26,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 10:01:26,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-02-08 10:01:26,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:01:26,132 INFO L225 Difference]: With dead ends: 91 [2025-02-08 10:01:26,132 INFO L226 Difference]: Without dead ends: 89 [2025-02-08 10:01:26,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 10:01:26,132 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 10:01:26,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 77 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:01:26,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-08 10:01:26,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-02-08 10:01:26,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 71 states have internal predecessors, (86), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2025-02-08 10:01:26,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 104 transitions. [2025-02-08 10:01:26,139 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 104 transitions. Word has length 23 [2025-02-08 10:01:26,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:01:26,139 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 104 transitions. [2025-02-08 10:01:26,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:01:26,140 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 104 transitions. [2025-02-08 10:01:26,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 10:01:26,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:01:26,140 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:01:26,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 10:01:26,140 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 10:01:26,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:01:26,141 INFO L85 PathProgramCache]: Analyzing trace with hash 301407307, now seen corresponding path program 1 times [2025-02-08 10:01:26,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:01:26,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932976289] [2025-02-08 10:01:26,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:01:26,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:01:26,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 10:01:26,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 10:01:26,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:01:26,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:01:26,201 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-08 10:01:26,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:01:26,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932976289] [2025-02-08 10:01:26,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932976289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:01:26,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:01:26,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 10:01:26,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818704033] [2025-02-08 10:01:26,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:01:26,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 10:01:26,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:01:26,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 10:01:26,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 10:01:26,203 INFO L87 Difference]: Start difference. First operand 89 states and 104 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:01:26,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:01:26,233 INFO L93 Difference]: Finished difference Result 101 states and 118 transitions. [2025-02-08 10:01:26,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 10:01:26,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-02-08 10:01:26,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:01:26,236 INFO L225 Difference]: With dead ends: 101 [2025-02-08 10:01:26,236 INFO L226 Difference]: Without dead ends: 99 [2025-02-08 10:01:26,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 10:01:26,236 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 87 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-08 10:01:26,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 87 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:01:26,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-08 10:01:26,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-02-08 10:01:26,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 79 states have internal predecessors, (94), 8 states have call successors, (8), 7 states have call predecessors, (8), 10 states have return successors, (12), 12 states have call predecessors, (12), 7 states have call successors, (12) [2025-02-08 10:01:26,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2025-02-08 10:01:26,250 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 28 [2025-02-08 10:01:26,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:01:26,250 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2025-02-08 10:01:26,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:01:26,250 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2025-02-08 10:01:26,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 10:01:26,250 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:01:26,250 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:01:26,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 10:01:26,251 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 10:01:26,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:01:26,251 INFO L85 PathProgramCache]: Analyzing trace with hash 338773732, now seen corresponding path program 1 times [2025-02-08 10:01:26,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:01:26,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720802647] [2025-02-08 10:01:26,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:01:26,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:01:26,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 10:01:26,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 10:01:26,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:01:26,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:01:26,291 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 10:01:26,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:01:26,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720802647] [2025-02-08 10:01:26,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720802647] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:01:26,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:01:26,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 10:01:26,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679890270] [2025-02-08 10:01:26,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:01:26,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 10:01:26,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:01:26,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 10:01:26,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 10:01:26,292 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 10:01:26,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:01:26,301 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2025-02-08 10:01:26,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 10:01:26,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-02-08 10:01:26,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:01:26,302 INFO L225 Difference]: With dead ends: 99 [2025-02-08 10:01:26,302 INFO L226 Difference]: Without dead ends: 98 [2025-02-08 10:01:26,303 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-08 10:01:26,303 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 51 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-08 10:01:26,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 51 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:01:26,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-08 10:01:26,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-02-08 10:01:26,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 75 states have (on average 1.2133333333333334) internal successors, (91), 78 states have internal predecessors, (91), 8 states have call successors, (8), 7 states have call predecessors, (8), 10 states have return successors, (12), 12 states have call predecessors, (12), 7 states have call successors, (12) [2025-02-08 10:01:26,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2025-02-08 10:01:26,317 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 28 [2025-02-08 10:01:26,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:01:26,317 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2025-02-08 10:01:26,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 10:01:26,317 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2025-02-08 10:01:26,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-08 10:01:26,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:01:26,317 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1] [2025-02-08 10:01:26,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 10:01:26,318 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting id2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 10:01:26,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:01:26,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1668226357, now seen corresponding path program 1 times [2025-02-08 10:01:26,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:01:26,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195090771] [2025-02-08 10:01:26,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:01:26,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:01:26,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 10:01:26,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 10:01:26,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:01:26,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:01:26,505 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:01:26,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:01:26,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195090771] [2025-02-08 10:01:26,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195090771] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:01:26,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990917334] [2025-02-08 10:01:26,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:01:26,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:01:26,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:01:26,508 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-08 10:01:26,510 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-08 10:01:26,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 10:01:26,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 10:01:26,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:01:26,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:01:26,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 10:01:26,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:01:26,576 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:01:26,576 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 10:01:26,757 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:01:26,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990917334] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 10:01:26,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 10:01:26,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 26 [2025-02-08 10:01:26,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183371166] [2025-02-08 10:01:26,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 10:01:26,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-08 10:01:26,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:01:26,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-08 10:01:26,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2025-02-08 10:01:26,759 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 28 states, 25 states have (on average 1.92) internal successors, (48), 15 states have internal predecessors, (48), 12 states have call successors, (12), 12 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:01:27,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:01:27,070 INFO L93 Difference]: Finished difference Result 241 states and 259 transitions. [2025-02-08 10:01:27,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-08 10:01:27,071 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 1.92) internal successors, (48), 15 states have internal predecessors, (48), 12 states have call successors, (12), 12 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-02-08 10:01:27,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:01:27,072 INFO L225 Difference]: With dead ends: 241 [2025-02-08 10:01:27,073 INFO L226 Difference]: Without dead ends: 211 [2025-02-08 10:01:27,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=252, Invalid=1308, Unknown=0, NotChecked=0, Total=1560 [2025-02-08 10:01:27,074 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 275 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:01:27,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 438 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:01:27,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-02-08 10:01:27,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 193. [2025-02-08 10:01:27,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 151 states have (on average 1.205298013245033) internal successors, (182), 154 states have internal predecessors, (182), 15 states have call successors, (15), 14 states have call predecessors, (15), 22 states have return successors, (24), 24 states have call predecessors, (24), 14 states have call successors, (24) [2025-02-08 10:01:27,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 221 transitions. [2025-02-08 10:01:27,092 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 221 transitions. Word has length 30 [2025-02-08 10:01:27,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:01:27,092 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 221 transitions. [2025-02-08 10:01:27,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 1.92) internal successors, (48), 15 states have internal predecessors, (48), 12 states have call successors, (12), 12 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:01:27,092 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 221 transitions. [2025-02-08 10:01:27,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-08 10:01:27,095 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:01:27,095 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:01:27,101 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-08 10:01:27,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:01:27,296 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 10:01:27,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:01:27,297 INFO L85 PathProgramCache]: Analyzing trace with hash -376636413, now seen corresponding path program 1 times [2025-02-08 10:01:27,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:01:27,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451289458] [2025-02-08 10:01:27,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:01:27,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:01:27,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 10:01:27,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 10:01:27,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:01:27,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:01:27,369 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 10:01:27,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:01:27,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451289458] [2025-02-08 10:01:27,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451289458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:01:27,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:01:27,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:01:27,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733349468] [2025-02-08 10:01:27,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:01:27,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:01:27,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:01:27,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:01:27,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:01:27,371 INFO L87 Difference]: Start difference. First operand 193 states and 221 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 10:01:27,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:01:27,401 INFO L93 Difference]: Finished difference Result 222 states and 256 transitions. [2025-02-08 10:01:27,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:01:27,402 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2025-02-08 10:01:27,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:01:27,406 INFO L225 Difference]: With dead ends: 222 [2025-02-08 10:01:27,406 INFO L226 Difference]: Without dead ends: 221 [2025-02-08 10:01:27,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:01:27,407 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 10:01:27,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:01:27,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-02-08 10:01:27,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 198. [2025-02-08 10:01:27,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 155 states have (on average 1.2) internal successors, (186), 158 states have internal predecessors, (186), 15 states have call successors, (15), 14 states have call predecessors, (15), 23 states have return successors, (25), 25 states have call predecessors, (25), 14 states have call successors, (25) [2025-02-08 10:01:27,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 226 transitions. [2025-02-08 10:01:27,424 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 226 transitions. Word has length 39 [2025-02-08 10:01:27,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:01:27,425 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 226 transitions. [2025-02-08 10:01:27,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 10:01:27,425 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 226 transitions. [2025-02-08 10:01:27,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-08 10:01:27,425 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:01:27,426 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:01:27,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 10:01:27,426 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 10:01:27,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:01:27,426 INFO L85 PathProgramCache]: Analyzing trace with hash 539794486, now seen corresponding path program 1 times [2025-02-08 10:01:27,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:01:27,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247917322] [2025-02-08 10:01:27,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:01:27,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:01:27,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 10:01:27,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 10:01:27,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:01:27,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:01:27,445 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-08 10:01:27,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:01:27,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247917322] [2025-02-08 10:01:27,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247917322] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:01:27,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:01:27,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 10:01:27,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589643665] [2025-02-08 10:01:27,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:01:27,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 10:01:27,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:01:27,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 10:01:27,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 10:01:27,447 INFO L87 Difference]: Start difference. First operand 198 states and 226 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 10:01:27,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:01:27,456 INFO L93 Difference]: Finished difference Result 198 states and 226 transitions. [2025-02-08 10:01:27,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 10:01:27,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2025-02-08 10:01:27,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:01:27,458 INFO L225 Difference]: With dead ends: 198 [2025-02-08 10:01:27,458 INFO L226 Difference]: Without dead ends: 197 [2025-02-08 10:01:27,458 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-08 10:01:27,458 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 49 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-08 10:01:27,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 49 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:01:27,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-02-08 10:01:27,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2025-02-08 10:01:27,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 155 states have (on average 1.1548387096774193) internal successors, (179), 157 states have internal predecessors, (179), 15 states have call successors, (15), 14 states have call predecessors, (15), 23 states have return successors, (25), 25 states have call predecessors, (25), 14 states have call successors, (25) [2025-02-08 10:01:27,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 219 transitions. [2025-02-08 10:01:27,468 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 219 transitions. Word has length 43 [2025-02-08 10:01:27,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:01:27,468 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 219 transitions. [2025-02-08 10:01:27,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 10:01:27,468 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 219 transitions. [2025-02-08 10:01:27,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 10:01:27,469 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:01:27,469 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:01:27,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 10:01:27,469 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 10:01:27,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:01:27,470 INFO L85 PathProgramCache]: Analyzing trace with hash -446240125, now seen corresponding path program 1 times [2025-02-08 10:01:27,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:01:27,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918381485] [2025-02-08 10:01:27,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:01:27,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:01:27,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 10:01:27,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 10:01:27,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:01:27,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:01:27,510 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-08 10:01:27,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:01:27,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918381485] [2025-02-08 10:01:27,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918381485] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:01:27,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:01:27,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:01:27,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659550688] [2025-02-08 10:01:27,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:01:27,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:01:27,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:01:27,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:01:27,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:01:27,512 INFO L87 Difference]: Start difference. First operand 197 states and 219 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 10:01:27,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:01:27,535 INFO L93 Difference]: Finished difference Result 246 states and 273 transitions. [2025-02-08 10:01:27,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:01:27,535 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2025-02-08 10:01:27,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:01:27,537 INFO L225 Difference]: With dead ends: 246 [2025-02-08 10:01:27,537 INFO L226 Difference]: Without dead ends: 245 [2025-02-08 10:01:27,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:01:27,537 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 10:01:27,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:01:27,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-02-08 10:01:27,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2025-02-08 10:01:27,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 194 states have (on average 1.1237113402061856) internal successors, (218), 195 states have internal predecessors, (218), 15 states have call successors, (15), 14 states have call predecessors, (15), 32 states have return successors, (35), 35 states have call predecessors, (35), 14 states have call successors, (35) [2025-02-08 10:01:27,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 268 transitions. [2025-02-08 10:01:27,548 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 268 transitions. Word has length 44 [2025-02-08 10:01:27,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:01:27,548 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 268 transitions. [2025-02-08 10:01:27,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 10:01:27,549 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 268 transitions. [2025-02-08 10:01:27,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 10:01:27,549 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:01:27,550 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:01:27,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 10:01:27,550 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 10:01:27,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:01:27,550 INFO L85 PathProgramCache]: Analyzing trace with hash 930283100, now seen corresponding path program 1 times [2025-02-08 10:01:27,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:01:27,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10805318] [2025-02-08 10:01:27,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:01:27,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:01:27,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 10:01:27,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 10:01:27,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:01:27,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:01:27,621 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 10:01:27,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:01:27,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10805318] [2025-02-08 10:01:27,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10805318] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:01:27,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105061986] [2025-02-08 10:01:27,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:01:27,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:01:27,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:01:27,624 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-08 10:01:27,626 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-08 10:01:27,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 10:01:27,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 10:01:27,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:01:27,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:01:27,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 10:01:27,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:01:27,681 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 10:01:27,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 10:01:27,823 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 10:01:27,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105061986] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 10:01:27,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 10:01:27,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-02-08 10:01:27,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057653487] [2025-02-08 10:01:27,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 10:01:27,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 10:01:27,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:01:27,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 10:01:27,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-02-08 10:01:27,825 INFO L87 Difference]: Start difference. First operand 245 states and 268 transitions. Second operand has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 16 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-08 10:01:27,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:01:27,867 INFO L93 Difference]: Finished difference Result 345 states and 386 transitions. [2025-02-08 10:01:27,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 10:01:27,867 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 16 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) Word has length 44 [2025-02-08 10:01:27,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:01:27,869 INFO L225 Difference]: With dead ends: 345 [2025-02-08 10:01:27,869 INFO L226 Difference]: Without dead ends: 318 [2025-02-08 10:01:27,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-02-08 10:01:27,869 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 10:01:27,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:01:27,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-02-08 10:01:27,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 270. [2025-02-08 10:01:27,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 214 states have (on average 1.1074766355140186) internal successors, (237), 215 states have internal predecessors, (237), 15 states have call successors, (15), 14 states have call predecessors, (15), 37 states have return successors, (40), 40 states have call predecessors, (40), 14 states have call successors, (40) [2025-02-08 10:01:27,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 292 transitions. [2025-02-08 10:01:27,880 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 292 transitions. Word has length 44 [2025-02-08 10:01:27,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:01:27,881 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 292 transitions. [2025-02-08 10:01:27,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 16 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-08 10:01:27,881 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 292 transitions. [2025-02-08 10:01:27,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-08 10:01:27,882 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:01:27,882 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-02-08 10:01:27,889 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-08 10:01:28,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:01:28,086 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 10:01:28,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:01:28,086 INFO L85 PathProgramCache]: Analyzing trace with hash 953166788, now seen corresponding path program 1 times [2025-02-08 10:01:28,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:01:28,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395765507] [2025-02-08 10:01:28,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:01:28,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:01:28,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 10:01:28,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 10:01:28,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:01:28,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:01:28,245 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-08 10:01:28,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:01:28,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395765507] [2025-02-08 10:01:28,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395765507] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:01:28,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285185324] [2025-02-08 10:01:28,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:01:28,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:01:28,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:01:28,251 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-08 10:01:28,258 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-08 10:01:28,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 10:01:28,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 10:01:28,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:01:28,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:01:28,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 10:01:28,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:01:28,343 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-08 10:01:28,343 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 10:01:28,968 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 20 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 10:01:28,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285185324] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 10:01:28,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 10:01:28,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 17] total 19 [2025-02-08 10:01:28,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825735443] [2025-02-08 10:01:28,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 10:01:28,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 10:01:28,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:01:28,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 10:01:28,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-02-08 10:01:28,971 INFO L87 Difference]: Start difference. First operand 270 states and 292 transitions. Second operand has 19 states, 18 states have (on average 3.111111111111111) internal successors, (56), 16 states have internal predecessors, (56), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2025-02-08 10:01:29,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:01:29,131 INFO L93 Difference]: Finished difference Result 458 states and 495 transitions. [2025-02-08 10:01:29,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 10:01:29,132 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.111111111111111) internal successors, (56), 16 states have internal predecessors, (56), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 59 [2025-02-08 10:01:29,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:01:29,133 INFO L225 Difference]: With dead ends: 458 [2025-02-08 10:01:29,134 INFO L226 Difference]: Without dead ends: 270 [2025-02-08 10:01:29,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 106 SyntacticMatches, 10 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2025-02-08 10:01:29,136 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 85 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:01:29,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 192 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:01:29,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-02-08 10:01:29,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2025-02-08 10:01:29,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 214 states have (on average 1.088785046728972) internal successors, (233), 215 states have internal predecessors, (233), 15 states have call successors, (15), 14 states have call predecessors, (15), 37 states have return successors, (40), 40 states have call predecessors, (40), 14 states have call successors, (40) [2025-02-08 10:01:29,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 288 transitions. [2025-02-08 10:01:29,152 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 288 transitions. Word has length 59 [2025-02-08 10:01:29,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:01:29,152 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 288 transitions. [2025-02-08 10:01:29,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.111111111111111) internal successors, (56), 16 states have internal predecessors, (56), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2025-02-08 10:01:29,152 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 288 transitions. [2025-02-08 10:01:29,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-08 10:01:29,153 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:01:29,153 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1] [2025-02-08 10:01:29,159 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-08 10:01:29,357 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,SelfDestructingSolverStorable13 [2025-02-08 10:01:29,357 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 10:01:29,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:01:29,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1184291611, now seen corresponding path program 2 times [2025-02-08 10:01:29,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:01:29,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035675145] [2025-02-08 10:01:29,358 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 10:01:29,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:01:29,363 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-02-08 10:01:29,370 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 10:01:29,370 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 10:01:29,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:01:29,752 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:01:29,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:01:29,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035675145] [2025-02-08 10:01:29,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035675145] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:01:29,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025525640] [2025-02-08 10:01:29,752 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 10:01:29,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:01:29,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:01:29,755 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-08 10:01:29,756 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-08 10:01:29,780 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-02-08 10:01:29,793 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 10:01:29,793 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 10:01:29,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:01:29,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 10:01:29,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:01:29,867 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:01:29,868 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 10:01:30,405 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:01:30,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025525640] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 10:01:30,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 10:01:30,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 54 [2025-02-08 10:01:30,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579621407] [2025-02-08 10:01:30,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 10:01:30,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-02-08 10:01:30,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:01:30,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-02-08 10:01:30,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=2656, Unknown=0, NotChecked=0, Total=3080 [2025-02-08 10:01:30,409 INFO L87 Difference]: Start difference. First operand 270 states and 288 transitions. Second operand has 56 states, 53 states have (on average 1.9622641509433962) internal successors, (104), 29 states have internal predecessors, (104), 26 states have call successors, (26), 26 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:01:31,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:01:31,155 INFO L93 Difference]: Finished difference Result 590 states and 614 transitions. [2025-02-08 10:01:31,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-02-08 10:01:31,156 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 53 states have (on average 1.9622641509433962) internal successors, (104), 29 states have internal predecessors, (104), 26 states have call successors, (26), 26 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-02-08 10:01:31,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:01:31,157 INFO L225 Difference]: With dead ends: 590 [2025-02-08 10:01:31,158 INFO L226 Difference]: Without dead ends: 588 [2025-02-08 10:01:31,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1737 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=970, Invalid=5510, Unknown=0, NotChecked=0, Total=6480 [2025-02-08 10:01:31,161 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 703 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 10:01:31,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 618 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 10:01:31,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-02-08 10:01:31,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 563. [2025-02-08 10:01:31,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 449 states have (on average 1.0846325167037862) internal successors, (487), 449 states have internal predecessors, (487), 28 states have call successors, (28), 27 states have call predecessors, (28), 82 states have return successors, (86), 86 states have call predecessors, (86), 27 states have call successors, (86) [2025-02-08 10:01:31,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 601 transitions. [2025-02-08 10:01:31,192 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 601 transitions. Word has length 65 [2025-02-08 10:01:31,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:01:31,192 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 601 transitions. [2025-02-08 10:01:31,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 53 states have (on average 1.9622641509433962) internal successors, (104), 29 states have internal predecessors, (104), 26 states have call successors, (26), 26 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:01:31,192 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 601 transitions. [2025-02-08 10:01:31,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-08 10:01:31,193 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:01:31,193 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2025-02-08 10:01:31,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 10:01:31,393 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,SelfDestructingSolverStorable14 [2025-02-08 10:01:31,394 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 10:01:31,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:01:31,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1644622415, now seen corresponding path program 1 times [2025-02-08 10:01:31,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:01:31,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283883601] [2025-02-08 10:01:31,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:01:31,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:01:31,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 10:01:31,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 10:01:31,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:01:31,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:01:31,551 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-02-08 10:01:31,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:01:31,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283883601] [2025-02-08 10:01:31,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283883601] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:01:31,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907193739] [2025-02-08 10:01:31,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:01:31,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:01:31,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:01:31,553 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-08 10:01:31,557 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-08 10:01:31,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 10:01:31,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 10:01:31,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:01:31,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:01:31,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 10:01:31,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:01:31,809 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 10:01:31,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 10:01:32,939 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 10:01:32,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907193739] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 10:01:32,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 10:01:32,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 19] total 38 [2025-02-08 10:01:32,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561086863] [2025-02-08 10:01:32,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 10:01:32,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-08 10:01:32,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:01:32,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-08 10:01:32,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1292, Unknown=0, NotChecked=0, Total=1406 [2025-02-08 10:01:32,941 INFO L87 Difference]: Start difference. First operand 563 states and 601 transitions. Second operand has 38 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 34 states have internal predecessors, (107), 14 states have call successors, (16), 5 states have call predecessors, (16), 12 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) [2025-02-08 10:01:33,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:01:33,332 INFO L93 Difference]: Finished difference Result 589 states and 627 transitions. [2025-02-08 10:01:33,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 10:01:33,333 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 34 states have internal predecessors, (107), 14 states have call successors, (16), 5 states have call predecessors, (16), 12 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) Word has length 69 [2025-02-08 10:01:33,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:01:33,333 INFO L225 Difference]: With dead ends: 589 [2025-02-08 10:01:33,334 INFO L226 Difference]: Without dead ends: 139 [2025-02-08 10:01:33,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 107 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=295, Invalid=2255, Unknown=0, NotChecked=0, Total=2550 [2025-02-08 10:01:33,335 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 128 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:01:33,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 165 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:01:33,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-02-08 10:01:33,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2025-02-08 10:01:33,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 109 states have internal predecessors, (110), 27 states have call successors, (27), 27 states have call predecessors, (27), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:01:33,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2025-02-08 10:01:33,340 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 69 [2025-02-08 10:01:33,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:01:33,340 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2025-02-08 10:01:33,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 34 states have internal predecessors, (107), 14 states have call successors, (16), 5 states have call predecessors, (16), 12 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) [2025-02-08 10:01:33,340 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2025-02-08 10:01:33,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-08 10:01:33,341 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:01:33,341 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 1, 1, 1] [2025-02-08 10:01:33,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 10:01:33,541 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,SelfDestructingSolverStorable15 [2025-02-08 10:01:33,542 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting id2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 10:01:33,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:01:33,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1409493085, now seen corresponding path program 2 times [2025-02-08 10:01:33,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:01:33,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79290537] [2025-02-08 10:01:33,542 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 10:01:33,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:01:33,546 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 130 statements into 2 equivalence classes. [2025-02-08 10:01:33,554 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 130 of 130 statements. [2025-02-08 10:01:33,554 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 10:01:33,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:01:34,630 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:01:34,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:01:34,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79290537] [2025-02-08 10:01:34,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79290537] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:01:34,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752317488] [2025-02-08 10:01:34,630 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 10:01:34,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:01:34,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:01:34,633 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-08 10:01:34,634 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-08 10:01:34,677 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 130 statements into 2 equivalence classes. [2025-02-08 10:01:34,699 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 130 of 130 statements. [2025-02-08 10:01:34,699 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 10:01:34,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:01:34,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-02-08 10:01:34,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:01:34,847 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:01:34,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 10:01:36,455 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:01:36,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752317488] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 10:01:36,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 10:01:36,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 106 [2025-02-08 10:01:36,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008376901] [2025-02-08 10:01:36,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 10:01:36,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2025-02-08 10:01:36,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:01:36,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2025-02-08 10:01:36,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1514, Invalid=10042, Unknown=0, NotChecked=0, Total=11556 [2025-02-08 10:01:36,459 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand has 108 states, 105 states have (on average 1.980952380952381) internal successors, (208), 55 states have internal predecessors, (208), 52 states have call successors, (52), 52 states have call predecessors, (52), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:01:38,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:01:38,097 INFO L93 Difference]: Finished difference Result 276 states and 301 transitions. [2025-02-08 10:01:38,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2025-02-08 10:01:38,097 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 105 states have (on average 1.980952380952381) internal successors, (208), 55 states have internal predecessors, (208), 52 states have call successors, (52), 52 states have call predecessors, (52), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2025-02-08 10:01:38,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:01:38,098 INFO L225 Difference]: With dead ends: 276 [2025-02-08 10:01:38,098 INFO L226 Difference]: Without dead ends: 274 [2025-02-08 10:01:38,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7600 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3672, Invalid=21768, Unknown=0, NotChecked=0, Total=25440 [2025-02-08 10:01:38,110 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 581 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 10:01:38,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 97 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 10:01:38,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-02-08 10:01:38,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 272. [2025-02-08 10:01:38,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 216 states have (on average 1.0092592592592593) internal successors, (218), 217 states have internal predecessors, (218), 54 states have call successors, (54), 54 states have call predecessors, (54), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:01:38,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2025-02-08 10:01:38,120 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 130 [2025-02-08 10:01:38,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:01:38,121 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 272 transitions. [2025-02-08 10:01:38,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 105 states have (on average 1.980952380952381) internal successors, (208), 55 states have internal predecessors, (208), 52 states have call successors, (52), 52 states have call predecessors, (52), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:01:38,121 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 272 transitions. [2025-02-08 10:01:38,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-02-08 10:01:38,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:01:38,124 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1] [2025-02-08 10:01:38,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 10:01:38,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:01:38,325 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 10:01:38,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:01:38,326 INFO L85 PathProgramCache]: Analyzing trace with hash -8574667, now seen corresponding path program 3 times [2025-02-08 10:01:38,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:01:38,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996361170] [2025-02-08 10:01:38,326 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 10:01:38,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:01:38,333 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 265 statements into 27 equivalence classes. [2025-02-08 10:01:38,354 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) and asserted 265 of 265 statements. [2025-02-08 10:01:38,354 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2025-02-08 10:01:38,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:01:42,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3328 backedges. 0 proven. 3328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:01:42,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:01:42,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996361170] [2025-02-08 10:01:42,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996361170] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:01:42,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831113902] [2025-02-08 10:01:42,200 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 10:01:42,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:01:42,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:01:42,202 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:01:42,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 10:01:42,242 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 265 statements into 27 equivalence classes. [2025-02-08 10:01:42,301 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) and asserted 265 of 265 statements. [2025-02-08 10:01:42,301 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2025-02-08 10:01:42,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:01:42,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 108 conjuncts are in the unsatisfiable core [2025-02-08 10:01:42,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:01:42,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3328 backedges. 0 proven. 3328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:01:42,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 10:01:47,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3328 backedges. 0 proven. 3328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:01:47,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831113902] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 10:01:47,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 10:01:47,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 214 [2025-02-08 10:01:47,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593604910] [2025-02-08 10:01:47,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 10:01:47,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 216 states [2025-02-08 10:01:47,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:01:47,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 216 interpolants. [2025-02-08 10:01:47,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5944, Invalid=40496, Unknown=0, NotChecked=0, Total=46440 [2025-02-08 10:01:47,959 INFO L87 Difference]: Start difference. First operand 272 states and 272 transitions. Second operand has 216 states, 213 states have (on average 1.9906103286384977) internal successors, (424), 109 states have internal predecessors, (424), 106 states have call successors, (106), 106 states have call predecessors, (106), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:01:53,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:01:53,607 INFO L93 Difference]: Finished difference Result 541 states and 592 transitions. [2025-02-08 10:01:53,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2025-02-08 10:01:53,608 INFO L78 Accepts]: Start accepts. Automaton has has 216 states, 213 states have (on average 1.9906103286384977) internal successors, (424), 109 states have internal predecessors, (424), 106 states have call successors, (106), 106 states have call predecessors, (106), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 265 [2025-02-08 10:01:53,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:01:53,610 INFO L225 Difference]: With dead ends: 541 [2025-02-08 10:01:53,610 INFO L226 Difference]: Without dead ends: 539 [2025-02-08 10:01:53,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 740 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 319 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32497 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=14530, Invalid=88190, Unknown=0, NotChecked=0, Total=102720 [2025-02-08 10:01:53,614 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 1377 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1377 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 10:01:53,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1377 Valid, 113 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 10:01:53,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-08 10:01:53,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 537. [2025-02-08 10:01:53,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 428 states have (on average 1.0046728971962617) internal successors, (430), 429 states have internal predecessors, (430), 107 states have call successors, (107), 107 states have call predecessors, (107), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:01:53,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 537 transitions. [2025-02-08 10:01:53,630 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 537 transitions. Word has length 265 [2025-02-08 10:01:53,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:01:53,630 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 537 transitions. [2025-02-08 10:01:53,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 216 states, 213 states have (on average 1.9906103286384977) internal successors, (424), 109 states have internal predecessors, (424), 106 states have call successors, (106), 106 states have call predecessors, (106), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:01:53,631 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 537 transitions. [2025-02-08 10:01:53,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2025-02-08 10:01:53,635 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:01:53,635 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 53, 53, 53, 53, 52, 52, 52, 1, 1, 1] [2025-02-08 10:01:53,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 10:01:53,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 10:01:53,839 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting id2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 10:01:53,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:01:53,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1267617021, now seen corresponding path program 3 times [2025-02-08 10:01:53,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:01:53,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602120665] [2025-02-08 10:01:53,840 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 10:01:53,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:01:53,849 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 530 statements into 53 equivalence classes. [2025-02-08 10:01:53,876 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) and asserted 280 of 530 statements. [2025-02-08 10:01:53,877 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2025-02-08 10:01:53,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:01:54,128 INFO L134 CoverageAnalysis]: Checked inductivity of 13676 backedges. 1352 proven. 24 refuted. 0 times theorem prover too weak. 12300 trivial. 0 not checked. [2025-02-08 10:01:54,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:01:54,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602120665] [2025-02-08 10:01:54,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602120665] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:01:54,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593731325] [2025-02-08 10:01:54,128 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 10:01:54,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:01:54,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:01:54,130 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:01:54,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 10:01:54,189 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 530 statements into 53 equivalence classes. [2025-02-08 10:01:54,255 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) and asserted 280 of 530 statements. [2025-02-08 10:01:54,256 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2025-02-08 10:01:54,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:01:54,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-08 10:01:54,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:01:54,306 INFO L134 CoverageAnalysis]: Checked inductivity of 13676 backedges. 1352 proven. 24 refuted. 0 times theorem prover too weak. 12300 trivial. 0 not checked. [2025-02-08 10:01:54,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 10:01:54,345 INFO L134 CoverageAnalysis]: Checked inductivity of 13676 backedges. 1352 proven. 24 refuted. 0 times theorem prover too weak. 12300 trivial. 0 not checked. [2025-02-08 10:01:54,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593731325] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 10:01:54,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 10:01:54,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 14 [2025-02-08 10:01:54,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913299361] [2025-02-08 10:01:54,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 10:01:54,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 10:01:54,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:01:54,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 10:01:54,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2025-02-08 10:01:54,364 INFO L87 Difference]: Start difference. First operand 537 states and 537 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 8 states have internal predecessors, (32), 7 states have call successors, (8), 7 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:01:54,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:01:54,482 INFO L93 Difference]: Finished difference Result 537 states and 537 transitions. [2025-02-08 10:01:54,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 10:01:54,482 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 8 states have internal predecessors, (32), 7 states have call successors, (8), 7 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 530 [2025-02-08 10:01:54,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:01:54,483 INFO L225 Difference]: With dead ends: 537 [2025-02-08 10:01:54,483 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 10:01:54,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1078 GetRequests, 1059 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2025-02-08 10:01:54,484 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 21 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:01:54,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 79 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:01:54,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 10:01:54,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 10:01:54,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-08 10:01:54,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 10:01:54,485 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 530 [2025-02-08 10:01:54,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:01:54,485 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 10:01:54,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 8 states have internal predecessors, (32), 7 states have call successors, (8), 7 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:01:54,485 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 10:01:54,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 10:01:54,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-02-08 10:01:54,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-02-08 10:01:54,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-02-08 10:01:54,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location id2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-02-08 10:01:54,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-02-08 10:01:54,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-02-08 10:01:54,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-02-08 10:01:54,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-02-08 10:01:54,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 10:01:54,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:01:54,694 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:01:54,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 10:01:55,277 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 10:01:55,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 10:01:55 BoogieIcfgContainer [2025-02-08 10:01:55,281 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 10:01:55,282 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 10:01:55,282 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 10:01:55,282 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 10:01:55,282 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 10:01:24" (3/4) ... [2025-02-08 10:01:55,284 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 10:01:55,287 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure id2 [2025-02-08 10:01:55,287 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure id [2025-02-08 10:01:55,291 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-08 10:01:55,291 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 10:01:55,291 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 10:01:55,291 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 10:01:55,337 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 10:01:55,338 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 10:01:55,338 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 10:01:55,339 INFO L158 Benchmark]: Toolchain (without parser) took 31157.14ms. Allocated memory was 142.6MB in the beginning and 595.6MB in the end (delta: 453.0MB). Free memory was 104.9MB in the beginning and 441.5MB in the end (delta: -336.6MB). Peak memory consumption was 111.9MB. Max. memory is 16.1GB. [2025-02-08 10:01:55,339 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 226.5MB. Free memory is still 143.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 10:01:55,339 INFO L158 Benchmark]: CACSL2BoogieTranslator took 131.19ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 94.7MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 10:01:55,339 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.20ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 93.8MB in the end (delta: 950.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 10:01:55,339 INFO L158 Benchmark]: Boogie Preprocessor took 20.02ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 92.8MB in the end (delta: 951.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 10:01:55,339 INFO L158 Benchmark]: IcfgBuilder took 192.73ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 80.8MB in the end (delta: 12.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 10:01:55,339 INFO L158 Benchmark]: TraceAbstraction took 30729.48ms. Allocated memory was 142.6MB in the beginning and 595.6MB in the end (delta: 453.0MB). Free memory was 80.8MB in the beginning and 445.4MB in the end (delta: -364.6MB). Peak memory consumption was 321.6MB. Max. memory is 16.1GB. [2025-02-08 10:01:55,340 INFO L158 Benchmark]: Witness Printer took 55.96ms. Allocated memory is still 595.6MB. Free memory was 445.4MB in the beginning and 441.5MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 10:01:55,340 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 226.5MB. Free memory is still 143.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 131.19ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 94.7MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.20ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 93.8MB in the end (delta: 950.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.02ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 92.8MB in the end (delta: 951.1kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 192.73ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 80.8MB in the end (delta: 12.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 30729.48ms. Allocated memory was 142.6MB in the beginning and 595.6MB in the end (delta: 453.0MB). Free memory was 80.8MB in the beginning and 445.4MB in the end (delta: -364.6MB). Peak memory consumption was 321.6MB. Max. memory is 16.1GB. * Witness Printer took 55.96ms. Allocated memory is still 595.6MB. Free memory was 445.4MB in the beginning and 441.5MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 35 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 30.1s, OverallIterations: 19, TraceHistogramMax: 53, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3413 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3409 mSDsluCounter, 2986 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2565 mSDsCounter, 270 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3725 IncrementalHoareTripleChecker+Invalid, 3995 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 270 mSolverCounterUnsat, 421 mSDtfsCounter, 3725 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2921 GetRequests, 2150 SyntacticMatches, 16 SemanticMatches, 755 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42848 ImplicationChecksByTransitivity, 18.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=563occurred in iteration=15, InterpolantAutomatonStates: 525, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 150 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 17.5s InterpolantComputationTime, 2651 NumberOfCodeBlocks, 2151 NumberOfCodeBlocksAsserted, 138 NumberOfCheckSat, 3821 ConstructedInterpolants, 0 QuantifiedInterpolants, 10407 SizeOfPredicates, 120 NumberOfNonLiveVariables, 1926 ConjunctsInSsa, 280 ConjunctsInUnsatCore, 37 InterpolantComputations, 10 PerfectInterpolantSequences, 41385/54493 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 10:01:55,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE