./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-numeric/rec_counter3.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-numeric/rec_counter3.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d7b4f33979632a981e739ff06b52fe01aa9fb175d5e5193b145052887f22f8a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:30:48,940 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:30:49,015 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-06 13:30:49,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:30:49,023 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:30:49,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:30:49,041 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:30:49,041 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:30:49,042 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:30:49,042 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:30:49,042 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:30:49,042 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:30:49,042 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:30:49,042 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:30:49,043 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:30:49,043 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:30:49,043 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 13:30:49,043 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:30:49,043 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:30:49,043 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 13:30:49,043 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:30:49,044 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 13:30:49,044 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 13:30:49,044 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:30:49,044 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 13:30:49,044 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:30:49,044 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:30:49,044 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:30:49,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:30:49,044 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:30:49,045 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:30:49,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:30:49,045 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:30:49,045 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:30:49,045 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 13:30:49,045 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 13:30:49,045 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:30:49,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:30:49,045 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:30:49,046 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:30:49,046 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:30:49,046 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:30:49,046 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d7b4f33979632a981e739ff06b52fe01aa9fb175d5e5193b145052887f22f8a3 [2025-02-06 13:30:49,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:30:49,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:30:49,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:30:49,331 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:30:49,332 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:30:49,332 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/rec_counter3.c [2025-02-06 13:30:50,582 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/94f6f25d5/18a98370ce0747cead51612adb82dabe/FLAGa1ef380da [2025-02-06 13:30:50,866 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:30:50,872 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-numeric/rec_counter3.c [2025-02-06 13:30:50,887 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/94f6f25d5/18a98370ce0747cead51612adb82dabe/FLAGa1ef380da [2025-02-06 13:30:50,906 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/94f6f25d5/18a98370ce0747cead51612adb82dabe [2025-02-06 13:30:50,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:30:50,910 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:30:50,912 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:30:50,912 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:30:50,915 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:30:50,916 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:30:50" (1/1) ... [2025-02-06 13:30:50,917 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85ec5fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:30:50, skipping insertion in model container [2025-02-06 13:30:50,919 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:30:50" (1/1) ... [2025-02-06 13:30:50,931 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:30:51,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:30:51,069 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:30:51,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:30:51,091 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:30:51,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:30:51 WrapperNode [2025-02-06 13:30:51,092 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:30:51,093 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:30:51,093 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:30:51,093 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:30:51,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:30:51" (1/1) ... [2025-02-06 13:30:51,102 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:30:51" (1/1) ... [2025-02-06 13:30:51,114 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 14 [2025-02-06 13:30:51,115 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:30:51,115 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:30:51,116 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:30:51,116 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:30:51,121 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:30:51" (1/1) ... [2025-02-06 13:30:51,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:30:51" (1/1) ... [2025-02-06 13:30:51,122 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:30:51" (1/1) ... [2025-02-06 13:30:51,125 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-06 13:30:51,125 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:30:51" (1/1) ... [2025-02-06 13:30:51,125 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:30:51" (1/1) ... [2025-02-06 13:30:51,126 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:30:51" (1/1) ... [2025-02-06 13:30:51,127 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:30:51" (1/1) ... [2025-02-06 13:30:51,127 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:30:51" (1/1) ... [2025-02-06 13:30:51,128 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:30:51" (1/1) ... [2025-02-06 13:30:51,129 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:30:51,129 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:30:51,129 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:30:51,129 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:30:51,130 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:30:51" (1/1) ... [2025-02-06 13:30:51,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:30:51,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:30:51,162 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 13:30:51,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 13:30:51,183 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2025-02-06 13:30:51,183 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2025-02-06 13:30:51,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:30:51,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:30:51,224 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:30:51,226 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:30:51,310 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7: havoc ~res~0, ~rescopy~0; [2025-02-06 13:30:51,334 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-02-06 13:30:51,334 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:30:51,343 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:30:51,343 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:30:51,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:30:51 BoogieIcfgContainer [2025-02-06 13:30:51,344 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:30:51,347 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:30:51,347 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:30:51,351 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:30:51,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:30:50" (1/3) ... [2025-02-06 13:30:51,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@569171c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:30:51, skipping insertion in model container [2025-02-06 13:30:51,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:30:51" (2/3) ... [2025-02-06 13:30:51,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@569171c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:30:51, skipping insertion in model container [2025-02-06 13:30:51,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:30:51" (3/3) ... [2025-02-06 13:30:51,353 INFO L128 eAbstractionObserver]: Analyzing ICFG rec_counter3.c [2025-02-06 13:30:51,369 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:30:51,371 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rec_counter3.c that has 2 procedures, 28 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2025-02-06 13:30:51,422 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:30:51,435 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;@2ee6fc5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:30:51,436 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 13:30:51,440 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 13:30:51,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 13:30:51,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:30:51,445 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:30:51,446 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting recErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:30:51,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:30:51,453 INFO L85 PathProgramCache]: Analyzing trace with hash -839714612, now seen corresponding path program 1 times [2025-02-06 13:30:51,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:30:51,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531179525] [2025-02-06 13:30:51,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:30:51,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:30:51,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 13:30:51,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 13:30:51,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:30:51,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:30:51,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:30:51,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:30:51,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531179525] [2025-02-06 13:30:51,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531179525] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:30:51,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:30:51,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:30:51,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557241879] [2025-02-06 13:30:51,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:30:51,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:30:51,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:30:51,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:30:51,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:30:51,663 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-06 13:30:51,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:30:51,764 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2025-02-06 13:30:51,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:30:51,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 7 [2025-02-06 13:30:51,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:30:51,771 INFO L225 Difference]: With dead ends: 55 [2025-02-06 13:30:51,771 INFO L226 Difference]: Without dead ends: 39 [2025-02-06 13:30:51,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-06 13:30:51,778 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 34 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:30:51,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 100 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:30:51,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-06 13:30:51,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2025-02-06 13:30:51,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 29 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 13:30:51,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2025-02-06 13:30:51,817 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 7 [2025-02-06 13:30:51,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:30:51,817 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2025-02-06 13:30:51,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-06 13:30:51,818 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2025-02-06 13:30:51,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 13:30:51,820 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:30:51,820 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:30:51,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:30:51,821 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting recErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:30:51,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:30:51,822 INFO L85 PathProgramCache]: Analyzing trace with hash -261349212, now seen corresponding path program 1 times [2025-02-06 13:30:51,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:30:51,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445172982] [2025-02-06 13:30:51,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:30:51,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:30:51,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 13:30:51,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 13:30:51,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:30:51,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:30:51,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:30:51,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:30:51,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445172982] [2025-02-06 13:30:51,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445172982] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:30:51,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:30:51,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:30:51,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316326772] [2025-02-06 13:30:51,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:30:51,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:30:51,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:30:51,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:30:51,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:30:51,908 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-06 13:30:51,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:30:51,961 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2025-02-06 13:30:51,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:30:51,962 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 8 [2025-02-06 13:30:51,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:30:51,964 INFO L225 Difference]: With dead ends: 36 [2025-02-06 13:30:51,965 INFO L226 Difference]: Without dead ends: 35 [2025-02-06 13:30:51,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-06 13:30:51,967 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 31 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 38 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-06 13:30:51,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 38 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:30:51,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-06 13:30:51,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2025-02-06 13:30:51,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 13:30:51,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2025-02-06 13:30:51,980 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 8 [2025-02-06 13:30:51,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:30:51,980 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2025-02-06 13:30:51,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-06 13:30:51,980 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2025-02-06 13:30:51,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 13:30:51,981 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:30:51,981 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:30:51,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:30:51,981 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting recErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:30:51,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:30:51,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1503400811, now seen corresponding path program 1 times [2025-02-06 13:30:51,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:30:51,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98535606] [2025-02-06 13:30:51,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:30:51,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:30:51,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:30:51,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:30:51,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:30:51,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:30:52,089 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-06 13:30:52,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:30:52,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98535606] [2025-02-06 13:30:52,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98535606] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:30:52,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553625494] [2025-02-06 13:30:52,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:30:52,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:30:52,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:30:52,094 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:30:52,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 13:30:52,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:30:52,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:30:52,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:30:52,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:30:52,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 13:30:52,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:30:52,169 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-06 13:30:52,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:30:52,261 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-06 13:30:52,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553625494] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:30:52,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:30:52,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-02-06 13:30:52,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471298696] [2025-02-06 13:30:52,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:30:52,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 13:30:52,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:30:52,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 13:30:52,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:30:52,263 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 12 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:30:52,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:30:52,347 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2025-02-06 13:30:52,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 13:30:52,347 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-06 13:30:52,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:30:52,348 INFO L225 Difference]: With dead ends: 39 [2025-02-06 13:30:52,348 INFO L226 Difference]: Without dead ends: 38 [2025-02-06 13:30:52,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-02-06 13:30:52,349 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 89 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:30:52,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 82 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:30:52,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-06 13:30:52,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2025-02-06 13:30:52,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 13:30:52,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2025-02-06 13:30:52,358 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 12 [2025-02-06 13:30:52,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:30:52,358 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2025-02-06 13:30:52,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:30:52,359 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2025-02-06 13:30:52,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 13:30:52,359 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:30:52,359 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:30:52,367 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-06 13:30:52,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:30:52,560 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting recErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:30:52,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:30:52,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1539058700, now seen corresponding path program 1 times [2025-02-06 13:30:52,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:30:52,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113989743] [2025-02-06 13:30:52,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:30:52,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:30:52,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 13:30:52,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 13:30:52,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:30:52,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:30:52,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:30:52,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:30:52,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113989743] [2025-02-06 13:30:52,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113989743] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:30:52,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:30:52,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:30:52,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679235892] [2025-02-06 13:30:52,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:30:52,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:30:52,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:30:52,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:30:52,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:30:52,633 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:30:52,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:30:52,642 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2025-02-06 13:30:52,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:30:52,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-02-06 13:30:52,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:30:52,645 INFO L225 Difference]: With dead ends: 32 [2025-02-06 13:30:52,645 INFO L226 Difference]: Without dead ends: 31 [2025-02-06 13:30:52,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:30:52,646 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:30:52,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 37 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:30:52,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-06 13:30:52,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-02-06 13:30:52,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 13:30:52,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2025-02-06 13:30:52,654 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 16 [2025-02-06 13:30:52,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:30:52,654 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-02-06 13:30:52,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:30:52,654 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2025-02-06 13:30:52,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 13:30:52,655 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:30:52,655 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:30:52,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 13:30:52,655 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:30:52,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:30:52,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1539058673, now seen corresponding path program 1 times [2025-02-06 13:30:52,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:30:52,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194826280] [2025-02-06 13:30:52,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:30:52,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:30:52,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 13:30:52,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 13:30:52,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:30:52,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:30:52,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:30:52,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:30:52,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194826280] [2025-02-06 13:30:52,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194826280] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:30:52,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:30:52,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:30:52,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116813198] [2025-02-06 13:30:52,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:30:52,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:30:52,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:30:52,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:30:52,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:30:52,709 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:30:52,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:30:52,720 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2025-02-06 13:30:52,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:30:52,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-02-06 13:30:52,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:30:52,722 INFO L225 Difference]: With dead ends: 31 [2025-02-06 13:30:52,722 INFO L226 Difference]: Without dead ends: 30 [2025-02-06 13:30:52,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:30:52,722 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:30:52,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 30 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:30:52,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-06 13:30:52,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-02-06 13:30:52,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 13:30:52,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2025-02-06 13:30:52,727 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 16 [2025-02-06 13:30:52,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:30:52,727 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2025-02-06 13:30:52,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:30:52,727 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2025-02-06 13:30:52,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 13:30:52,728 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:30:52,728 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:30:52,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 13:30:52,728 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:30:52,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:30:52,729 INFO L85 PathProgramCache]: Analyzing trace with hash -466179468, now seen corresponding path program 1 times [2025-02-06 13:30:52,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:30:52,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484922644] [2025-02-06 13:30:52,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:30:52,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:30:52,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 13:30:52,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 13:30:52,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:30:52,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:30:52,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:30:52,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:30:52,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484922644] [2025-02-06 13:30:52,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484922644] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:30:52,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:30:52,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:30:52,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350984939] [2025-02-06 13:30:52,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:30:52,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:30:52,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:30:52,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:30:52,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:30:52,824 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:30:52,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:30:52,850 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2025-02-06 13:30:52,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:30:52,851 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-02-06 13:30:52,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:30:52,851 INFO L225 Difference]: With dead ends: 52 [2025-02-06 13:30:52,851 INFO L226 Difference]: Without dead ends: 36 [2025-02-06 13:30:52,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:30:52,852 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:30:52,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:30:52,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-06 13:30:52,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-02-06 13:30:52,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 13:30:52,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2025-02-06 13:30:52,864 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 17 [2025-02-06 13:30:52,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:30:52,864 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2025-02-06 13:30:52,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:30:52,864 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2025-02-06 13:30:52,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 13:30:52,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:30:52,864 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:30:52,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 13:30:52,865 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:30:52,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:30:52,865 INFO L85 PathProgramCache]: Analyzing trace with hash -466178635, now seen corresponding path program 1 times [2025-02-06 13:30:52,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:30:52,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367010672] [2025-02-06 13:30:52,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:30:52,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:30:52,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 13:30:52,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 13:30:52,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:30:52,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:30:52,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:30:52,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:30:52,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367010672] [2025-02-06 13:30:52,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367010672] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:30:52,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:30:52,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:30:52,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434579842] [2025-02-06 13:30:52,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:30:52,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:30:52,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:30:52,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:30:52,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:30:52,900 INFO L87 Difference]: Start difference. First operand 36 states and 42 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:30:52,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:30:52,926 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2025-02-06 13:30:52,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:30:52,927 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-02-06 13:30:52,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:30:52,927 INFO L225 Difference]: With dead ends: 43 [2025-02-06 13:30:52,927 INFO L226 Difference]: Without dead ends: 38 [2025-02-06 13:30:52,928 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-06 13:30:52,928 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:30:52,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:30:52,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-06 13:30:52,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-02-06 13:30:52,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 13:30:52,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2025-02-06 13:30:52,935 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 17 [2025-02-06 13:30:52,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:30:52,935 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2025-02-06 13:30:52,935 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:30:52,935 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2025-02-06 13:30:52,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 13:30:52,936 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:30:52,936 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:30:52,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 13:30:52,936 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:30:52,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:30:52,936 INFO L85 PathProgramCache]: Analyzing trace with hash -618371193, now seen corresponding path program 1 times [2025-02-06 13:30:52,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:30:52,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623121705] [2025-02-06 13:30:52,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:30:52,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:30:52,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 13:30:52,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 13:30:52,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:30:52,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:30:53,045 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 13:30:53,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:30:53,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623121705] [2025-02-06 13:30:53,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623121705] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:30:53,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046584545] [2025-02-06 13:30:53,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:30:53,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:30:53,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:30:53,047 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:30:53,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 13:30:53,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 13:30:53,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 13:30:53,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:30:53,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:30:53,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 13:30:53,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:30:53,144 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 13:30:53,144 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:30:53,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046584545] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:30:53,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:30:53,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-02-06 13:30:53,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314894133] [2025-02-06 13:30:53,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:30:53,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:30:53,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:30:53,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:30:53,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-06 13:30:53,149 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:30:53,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:30:53,176 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2025-02-06 13:30:53,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:30:53,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-02-06 13:30:53,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:30:53,178 INFO L225 Difference]: With dead ends: 38 [2025-02-06 13:30:53,178 INFO L226 Difference]: Without dead ends: 37 [2025-02-06 13:30:53,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-06 13:30:53,180 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:30:53,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:30:53,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-06 13:30:53,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-02-06 13:30:53,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 13:30:53,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2025-02-06 13:30:53,191 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 28 [2025-02-06 13:30:53,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:30:53,192 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2025-02-06 13:30:53,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:30:53,192 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2025-02-06 13:30:53,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 13:30:53,193 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:30:53,193 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:30:53,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 13:30:53,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:30:53,394 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:30:53,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:30:53,394 INFO L85 PathProgramCache]: Analyzing trace with hash -781497212, now seen corresponding path program 1 times [2025-02-06 13:30:53,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:30:53,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456619786] [2025-02-06 13:30:53,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:30:53,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:30:53,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 13:30:53,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 13:30:53,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:30:53,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:30:53,454 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 13:30:53,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:30:53,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456619786] [2025-02-06 13:30:53,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456619786] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:30:53,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969953423] [2025-02-06 13:30:53,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:30:53,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:30:53,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:30:53,457 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:30:53,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 13:30:53,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 13:30:53,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 13:30:53,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:30:53,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:30:53,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 13:30:53,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:30:53,561 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 13:30:53,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:30:53,734 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 13:30:53,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969953423] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:30:53,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:30:53,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 16 [2025-02-06 13:30:53,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906031791] [2025-02-06 13:30:53,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:30:53,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 13:30:53,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:30:53,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 13:30:53,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-02-06 13:30:53,740 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 17 states, 16 states have (on average 2.875) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 13:30:53,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:30:53,939 INFO L93 Difference]: Finished difference Result 110 states and 137 transitions. [2025-02-06 13:30:53,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-06 13:30:53,940 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) Word has length 31 [2025-02-06 13:30:53,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:30:53,941 INFO L225 Difference]: With dead ends: 110 [2025-02-06 13:30:53,941 INFO L226 Difference]: Without dead ends: 79 [2025-02-06 13:30:53,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2025-02-06 13:30:53,942 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:30:53,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 138 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:30:53,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-06 13:30:53,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2025-02-06 13:30:53,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 67 states have (on average 1.208955223880597) internal successors, (81), 67 states have internal predecessors, (81), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (6), 6 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 13:30:53,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2025-02-06 13:30:53,953 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 31 [2025-02-06 13:30:53,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:30:53,953 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2025-02-06 13:30:53,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 13:30:53,953 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2025-02-06 13:30:53,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-06 13:30:53,955 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:30:53,955 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-02-06 13:30:53,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 13:30:54,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:30:54,159 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:30:54,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:30:54,160 INFO L85 PathProgramCache]: Analyzing trace with hash -764071861, now seen corresponding path program 2 times [2025-02-06 13:30:54,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:30:54,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271657782] [2025-02-06 13:30:54,160 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:30:54,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:30:54,169 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 82 statements into 2 equivalence classes. [2025-02-06 13:30:54,187 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 13:30:54,188 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:30:54,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:30:54,634 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 121 proven. 29 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-02-06 13:30:54,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:30:54,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271657782] [2025-02-06 13:30:54,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271657782] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:30:54,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700486890] [2025-02-06 13:30:54,635 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:30:54,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:30:54,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:30:54,638 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:30:54,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 13:30:54,671 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 82 statements into 2 equivalence classes. [2025-02-06 13:30:54,696 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 13:30:54,696 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:30:54,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:30:54,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 13:30:54,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:30:54,819 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 110 proven. 35 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-02-06 13:30:54,819 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:30:55,623 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 110 proven. 35 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-02-06 13:30:55,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700486890] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:30:55,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:30:55,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 22 [2025-02-06 13:30:55,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422594948] [2025-02-06 13:30:55,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:30:55,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 13:30:55,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:30:55,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 13:30:55,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2025-02-06 13:30:55,628 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. Second operand has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 18 states have internal predecessors, (54), 1 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (6), 5 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-06 13:30:55,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:30:55,988 INFO L93 Difference]: Finished difference Result 143 states and 173 transitions. [2025-02-06 13:30:55,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 13:30:55,989 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 18 states have internal predecessors, (54), 1 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (6), 5 states have call predecessors, (6), 1 states have call successors, (6) Word has length 82 [2025-02-06 13:30:55,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:30:55,990 INFO L225 Difference]: With dead ends: 143 [2025-02-06 13:30:55,990 INFO L226 Difference]: Without dead ends: 85 [2025-02-06 13:30:55,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 145 SyntacticMatches, 16 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=1196, Unknown=0, NotChecked=0, Total=1406 [2025-02-06 13:30:55,991 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 13 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 13:30:55,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 152 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 13:30:55,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-06 13:30:56,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-02-06 13:30:56,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 76 states have internal predecessors, (83), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (6), 6 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 13:30:56,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2025-02-06 13:30:56,002 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 82 [2025-02-06 13:30:56,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:30:56,003 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2025-02-06 13:30:56,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 18 states have internal predecessors, (54), 1 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (6), 5 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-06 13:30:56,003 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2025-02-06 13:30:56,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-06 13:30:56,004 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:30:56,004 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-02-06 13:30:56,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 13:30:56,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 13:30:56,209 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:30:56,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:30:56,210 INFO L85 PathProgramCache]: Analyzing trace with hash -368853993, now seen corresponding path program 3 times [2025-02-06 13:30:56,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:30:56,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056528157] [2025-02-06 13:30:56,210 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:30:56,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:30:56,218 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 98 statements into 8 equivalence classes. [2025-02-06 13:30:56,234 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 63 of 98 statements. [2025-02-06 13:30:56,234 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 13:30:56,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:30:56,347 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 84 proven. 12 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-02-06 13:30:56,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:30:56,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056528157] [2025-02-06 13:30:56,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056528157] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:30:56,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180545266] [2025-02-06 13:30:56,347 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:30:56,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:30:56,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:30:56,349 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:30:56,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 13:30:56,384 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 98 statements into 8 equivalence classes. [2025-02-06 13:30:56,401 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 63 of 98 statements. [2025-02-06 13:30:56,401 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 13:30:56,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:30:56,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 13:30:56,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:30:56,434 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 84 proven. 12 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-02-06 13:30:56,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:30:56,621 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 84 proven. 12 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-02-06 13:30:56,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180545266] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:30:56,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:30:56,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-02-06 13:30:56,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091286851] [2025-02-06 13:30:56,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:30:56,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 13:30:56,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:30:56,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 13:30:56,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-02-06 13:30:56,622 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:30:56,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:30:56,700 INFO L93 Difference]: Finished difference Result 175 states and 206 transitions. [2025-02-06 13:30:56,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 13:30:56,702 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2025-02-06 13:30:56,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:30:56,703 INFO L225 Difference]: With dead ends: 175 [2025-02-06 13:30:56,703 INFO L226 Difference]: Without dead ends: 170 [2025-02-06 13:30:56,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-02-06 13:30:56,704 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:30:56,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:30:56,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-02-06 13:30:56,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 109. [2025-02-06 13:30:56,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 100 states have (on average 1.11) internal successors, (111), 100 states have internal predecessors, (111), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (6), 6 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 13:30:56,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2025-02-06 13:30:56,728 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 98 [2025-02-06 13:30:56,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:30:56,728 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2025-02-06 13:30:56,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:30:56,728 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2025-02-06 13:30:56,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 13:30:56,730 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:30:56,731 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-02-06 13:30:56,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 13:30:56,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 13:30:56,931 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:30:56,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:30:56,932 INFO L85 PathProgramCache]: Analyzing trace with hash 932682807, now seen corresponding path program 4 times [2025-02-06 13:30:56,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:30:56,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649901642] [2025-02-06 13:30:56,932 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 13:30:56,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:30:56,938 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 100 statements into 2 equivalence classes. [2025-02-06 13:30:56,961 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 13:30:56,961 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 13:30:56,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:30:57,600 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 211 proven. 126 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-06 13:30:57,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:30:57,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649901642] [2025-02-06 13:30:57,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649901642] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:30:57,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98021468] [2025-02-06 13:30:57,601 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 13:30:57,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:30:57,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:30:57,603 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:30:57,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 13:30:57,654 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 100 statements into 2 equivalence classes. [2025-02-06 13:30:57,681 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 13:30:57,681 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 13:30:57,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:30:57,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 13:30:57,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:30:57,915 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 0 proven. 271 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-06 13:30:57,915 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:30:58,925 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 0 proven. 271 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-06 13:30:58,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98021468] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:30:58,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:30:58,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 16, 16] total 50 [2025-02-06 13:30:58,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221647983] [2025-02-06 13:30:58,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:30:58,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-02-06 13:30:58,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:30:58,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-02-06 13:30:58,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=2166, Unknown=0, NotChecked=0, Total=2450 [2025-02-06 13:30:58,929 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand has 50 states, 50 states have (on average 2.54) internal successors, (127), 40 states have internal predecessors, (127), 1 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (11), 11 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 13:30:59,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:30:59,904 INFO L93 Difference]: Finished difference Result 498 states and 562 transitions. [2025-02-06 13:30:59,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2025-02-06 13:30:59,904 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.54) internal successors, (127), 40 states have internal predecessors, (127), 1 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (11), 11 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2025-02-06 13:30:59,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:30:59,907 INFO L225 Difference]: With dead ends: 498 [2025-02-06 13:30:59,909 INFO L226 Difference]: Without dead ends: 274 [2025-02-06 13:30:59,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3448 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1156, Invalid=8350, Unknown=0, NotChecked=0, Total=9506 [2025-02-06 13:30:59,917 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 10 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 13:30:59,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 259 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 13:30:59,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-02-06 13:30:59,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 202. [2025-02-06 13:30:59,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 187 states have (on average 1.0748663101604279) internal successors, (201), 187 states have internal predecessors, (201), 3 states have call successors, (3), 2 states have call predecessors, (3), 11 states have return successors, (12), 12 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 13:30:59,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 216 transitions. [2025-02-06 13:30:59,947 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 216 transitions. Word has length 100 [2025-02-06 13:30:59,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:30:59,948 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 216 transitions. [2025-02-06 13:30:59,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.54) internal successors, (127), 40 states have internal predecessors, (127), 1 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (11), 11 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 13:30:59,948 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 216 transitions. [2025-02-06 13:30:59,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-02-06 13:30:59,950 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:30:59,950 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2025-02-06 13:30:59,958 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-06 13:31:00,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-06 13:31:00,155 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:31:00,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:31:00,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1800936407, now seen corresponding path program 5 times [2025-02-06 13:31:00,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:31:00,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800493731] [2025-02-06 13:31:00,156 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 13:31:00,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:31:00,168 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 220 statements into 14 equivalence classes. [2025-02-06 13:31:00,185 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 94 of 220 statements. [2025-02-06 13:31:00,185 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-02-06 13:31:00,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:31:00,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2363 backedges. 1041 proven. 53 refuted. 0 times theorem prover too weak. 1269 trivial. 0 not checked. [2025-02-06 13:31:00,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:31:00,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800493731] [2025-02-06 13:31:00,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800493731] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:31:00,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072566029] [2025-02-06 13:31:00,448 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 13:31:00,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:31:00,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:31:00,450 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:31:00,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 13:31:00,506 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 220 statements into 14 equivalence classes. [2025-02-06 13:31:00,532 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 94 of 220 statements. [2025-02-06 13:31:00,533 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-02-06 13:31:00,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:31:00,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 13:31:00,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:31:00,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2363 backedges. 1025 proven. 88 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-02-06 13:31:00,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:31:01,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2363 backedges. 1043 proven. 70 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-02-06 13:31:01,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072566029] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:31:01,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:31:01,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 23 [2025-02-06 13:31:01,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696166362] [2025-02-06 13:31:01,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:31:01,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 13:31:01,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:31:01,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 13:31:01,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2025-02-06 13:31:01,786 INFO L87 Difference]: Start difference. First operand 202 states and 216 transitions. Second operand has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 21 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 13:31:02,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:31:02,138 INFO L93 Difference]: Finished difference Result 347 states and 378 transitions. [2025-02-06 13:31:02,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 13:31:02,138 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 21 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) Word has length 220 [2025-02-06 13:31:02,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:31:02,140 INFO L225 Difference]: With dead ends: 347 [2025-02-06 13:31:02,140 INFO L226 Difference]: Without dead ends: 217 [2025-02-06 13:31:02,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 421 SyntacticMatches, 13 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=238, Invalid=1094, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 13:31:02,142 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 13:31:02,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 268 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 13:31:02,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-02-06 13:31:02,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2025-02-06 13:31:02,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 202 states have (on average 1.0594059405940595) internal successors, (214), 202 states have internal predecessors, (214), 3 states have call successors, (3), 2 states have call predecessors, (3), 11 states have return successors, (12), 12 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 13:31:02,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 229 transitions. [2025-02-06 13:31:02,160 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 229 transitions. Word has length 220 [2025-02-06 13:31:02,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:31:02,160 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 229 transitions. [2025-02-06 13:31:02,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 21 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 13:31:02,161 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 229 transitions. [2025-02-06 13:31:02,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-02-06 13:31:02,163 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:31:02,163 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2025-02-06 13:31:02,171 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-06 13:31:02,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:31:02,364 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:31:02,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:31:02,365 INFO L85 PathProgramCache]: Analyzing trace with hash 923560347, now seen corresponding path program 6 times [2025-02-06 13:31:02,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:31:02,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762639706] [2025-02-06 13:31:02,365 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 13:31:02,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:31:02,376 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 238 statements into 14 equivalence classes. [2025-02-06 13:31:02,402 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 172 of 238 statements. [2025-02-06 13:31:02,402 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-02-06 13:31:02,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:31:02,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3032 backedges. 1093 proven. 120 refuted. 0 times theorem prover too weak. 1819 trivial. 0 not checked. [2025-02-06 13:31:02,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:31:02,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762639706] [2025-02-06 13:31:02,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762639706] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:31:02,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048575378] [2025-02-06 13:31:02,716 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 13:31:02,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:31:02,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:31:02,718 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-06 13:31:02,721 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-06 13:31:02,790 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 238 statements into 14 equivalence classes. [2025-02-06 13:31:02,836 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 172 of 238 statements. [2025-02-06 13:31:02,836 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-02-06 13:31:02,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:31:02,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 13:31:02,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:31:02,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3032 backedges. 1093 proven. 120 refuted. 0 times theorem prover too weak. 1819 trivial. 0 not checked. [2025-02-06 13:31:02,921 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:31:03,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3032 backedges. 1093 proven. 120 refuted. 0 times theorem prover too weak. 1819 trivial. 0 not checked. [2025-02-06 13:31:03,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048575378] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:31:03,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:31:03,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 29 [2025-02-06 13:31:03,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101208427] [2025-02-06 13:31:03,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:31:03,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-06 13:31:03,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:31:03,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-06 13:31:03,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=687, Unknown=0, NotChecked=0, Total=870 [2025-02-06 13:31:03,532 INFO L87 Difference]: Start difference. First operand 217 states and 229 transitions. Second operand has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 13:31:03,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:31:03,980 INFO L93 Difference]: Finished difference Result 614 states and 695 transitions. [2025-02-06 13:31:03,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-02-06 13:31:03,981 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 238 [2025-02-06 13:31:03,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:31:03,984 INFO L225 Difference]: With dead ends: 614 [2025-02-06 13:31:03,984 INFO L226 Difference]: Without dead ends: 555 [2025-02-06 13:31:03,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=676, Invalid=2404, Unknown=0, NotChecked=0, Total=3080 [2025-02-06 13:31:03,986 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:31:03,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:31:03,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-02-06 13:31:04,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 247. [2025-02-06 13:31:04,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 232 states have (on average 1.0862068965517242) internal successors, (252), 232 states have internal predecessors, (252), 3 states have call successors, (3), 2 states have call predecessors, (3), 11 states have return successors, (12), 12 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 13:31:04,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 267 transitions. [2025-02-06 13:31:04,015 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 267 transitions. Word has length 238 [2025-02-06 13:31:04,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:31:04,016 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 267 transitions. [2025-02-06 13:31:04,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 13:31:04,016 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 267 transitions. [2025-02-06 13:31:04,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-02-06 13:31:04,018 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:31:04,019 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2025-02-06 13:31:04,027 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-06 13:31:04,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:31:04,219 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:31:04,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:31:04,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1736679569, now seen corresponding path program 7 times [2025-02-06 13:31:04,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:31:04,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437393532] [2025-02-06 13:31:04,220 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 13:31:04,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:31:04,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-06 13:31:04,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-06 13:31:04,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:31:04,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:31:04,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4092 backedges. 2388 proven. 90 refuted. 0 times theorem prover too weak. 1614 trivial. 0 not checked. [2025-02-06 13:31:04,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:31:04,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437393532] [2025-02-06 13:31:04,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437393532] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:31:04,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799943965] [2025-02-06 13:31:04,842 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 13:31:04,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:31:04,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:31:04,845 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-06 13:31:04,848 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-06 13:31:04,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-06 13:31:04,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-06 13:31:04,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:31:04,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:31:04,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 13:31:04,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:31:05,269 INFO L134 CoverageAnalysis]: Checked inductivity of 4092 backedges. 1958 proven. 177 refuted. 0 times theorem prover too weak. 1957 trivial. 0 not checked. [2025-02-06 13:31:05,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:31:08,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4092 backedges. 1958 proven. 177 refuted. 0 times theorem prover too weak. 1957 trivial. 0 not checked. [2025-02-06 13:31:08,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799943965] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:31:08,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:31:08,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 28, 28] total 37 [2025-02-06 13:31:08,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613256734] [2025-02-06 13:31:08,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:31:08,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-06 13:31:08,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:31:08,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-06 13:31:08,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1180, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 13:31:08,266 INFO L87 Difference]: Start difference. First operand 247 states and 267 transitions. Second operand has 37 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 31 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 13:31:08,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:31:08,933 INFO L93 Difference]: Finished difference Result 413 states and 454 transitions. [2025-02-06 13:31:08,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-02-06 13:31:08,934 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 31 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) Word has length 262 [2025-02-06 13:31:08,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:31:08,935 INFO L225 Difference]: With dead ends: 413 [2025-02-06 13:31:08,935 INFO L226 Difference]: Without dead ends: 256 [2025-02-06 13:31:08,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 573 GetRequests, 482 SyntacticMatches, 26 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1975 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=512, Invalid=3910, Unknown=0, NotChecked=0, Total=4422 [2025-02-06 13:31:08,938 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 13:31:08,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 13:31:08,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-02-06 13:31:08,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2025-02-06 13:31:08,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 241 states have (on average 1.070539419087137) internal successors, (258), 241 states have internal predecessors, (258), 3 states have call successors, (3), 2 states have call predecessors, (3), 11 states have return successors, (12), 12 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 13:31:08,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 273 transitions. [2025-02-06 13:31:08,961 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 273 transitions. Word has length 262 [2025-02-06 13:31:08,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:31:08,962 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 273 transitions. [2025-02-06 13:31:08,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 31 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 13:31:08,962 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 273 transitions. [2025-02-06 13:31:08,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-02-06 13:31:08,965 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:31:08,965 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2025-02-06 13:31:08,973 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-06 13:31:09,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:31:09,166 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:31:09,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:31:09,166 INFO L85 PathProgramCache]: Analyzing trace with hash -38052587, now seen corresponding path program 8 times [2025-02-06 13:31:09,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:31:09,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949986258] [2025-02-06 13:31:09,166 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:31:09,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:31:09,186 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 271 statements into 2 equivalence classes. [2025-02-06 13:31:09,237 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 271 of 271 statements. [2025-02-06 13:31:09,237 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:31:09,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:31:09,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4539 backedges. 2742 proven. 138 refuted. 0 times theorem prover too weak. 1659 trivial. 0 not checked. [2025-02-06 13:31:09,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:31:09,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949986258] [2025-02-06 13:31:09,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949986258] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:31:09,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163954247] [2025-02-06 13:31:09,860 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:31:09,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:31:09,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:31:09,862 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:31:09,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 13:31:09,972 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 271 statements into 2 equivalence classes. [2025-02-06 13:31:10,035 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 271 of 271 statements. [2025-02-06 13:31:10,035 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:31:10,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:31:10,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 13:31:10,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:31:10,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4539 backedges. 2566 proven. 311 refuted. 0 times theorem prover too weak. 1662 trivial. 0 not checked. [2025-02-06 13:31:10,471 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:31:14,348 INFO L134 CoverageAnalysis]: Checked inductivity of 4539 backedges. 2566 proven. 311 refuted. 0 times theorem prover too weak. 1662 trivial. 0 not checked. [2025-02-06 13:31:14,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163954247] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:31:14,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:31:14,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 33, 33] total 44 [2025-02-06 13:31:14,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688166301] [2025-02-06 13:31:14,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:31:14,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-02-06 13:31:14,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:31:14,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-02-06 13:31:14,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1691, Unknown=0, NotChecked=0, Total=1892 [2025-02-06 13:31:14,350 INFO L87 Difference]: Start difference. First operand 256 states and 273 transitions. Second operand has 44 states, 44 states have (on average 2.4318181818181817) internal successors, (107), 37 states have internal predecessors, (107), 1 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (9), 9 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 13:31:15,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:31:15,337 INFO L93 Difference]: Finished difference Result 407 states and 441 transitions. [2025-02-06 13:31:15,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-02-06 13:31:15,338 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.4318181818181817) internal successors, (107), 37 states have internal predecessors, (107), 1 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (9), 9 states have call predecessors, (9), 1 states have call successors, (9) Word has length 271 [2025-02-06 13:31:15,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:31:15,339 INFO L225 Difference]: With dead ends: 407 [2025-02-06 13:31:15,339 INFO L226 Difference]: Without dead ends: 265 [2025-02-06 13:31:15,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 492 SyntacticMatches, 31 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3327 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=823, Invalid=6659, Unknown=0, NotChecked=0, Total=7482 [2025-02-06 13:31:15,342 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 13:31:15,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 510 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1510 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 13:31:15,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-02-06 13:31:15,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2025-02-06 13:31:15,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 250 states have (on average 1.06) internal successors, (265), 250 states have internal predecessors, (265), 3 states have call successors, (3), 2 states have call predecessors, (3), 11 states have return successors, (12), 12 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 13:31:15,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 280 transitions. [2025-02-06 13:31:15,367 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 280 transitions. Word has length 271 [2025-02-06 13:31:15,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:31:15,367 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 280 transitions. [2025-02-06 13:31:15,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.4318181818181817) internal successors, (107), 37 states have internal predecessors, (107), 1 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (9), 9 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 13:31:15,368 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 280 transitions. [2025-02-06 13:31:15,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2025-02-06 13:31:15,371 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:31:15,371 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2025-02-06 13:31:15,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 13:31:15,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-06 13:31:15,572 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:31:15,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:31:15,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1003439445, now seen corresponding path program 9 times [2025-02-06 13:31:15,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:31:15,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825237000] [2025-02-06 13:31:15,573 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:31:15,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:31:15,585 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 280 statements into 14 equivalence classes. [2025-02-06 13:31:15,607 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 196 of 280 statements. [2025-02-06 13:31:15,607 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-02-06 13:31:15,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:31:16,009 INFO L134 CoverageAnalysis]: Checked inductivity of 5013 backedges. 2343 proven. 678 refuted. 0 times theorem prover too weak. 1992 trivial. 0 not checked. [2025-02-06 13:31:16,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:31:16,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825237000] [2025-02-06 13:31:16,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825237000] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:31:16,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167755631] [2025-02-06 13:31:16,010 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:31:16,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:31:16,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:31:16,013 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:31:16,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 13:31:16,211 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 280 statements into 14 equivalence classes. [2025-02-06 13:31:16,260 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 196 of 280 statements. [2025-02-06 13:31:16,260 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-02-06 13:31:16,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:31:16,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 13:31:16,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:31:16,390 INFO L134 CoverageAnalysis]: Checked inductivity of 5013 backedges. 2343 proven. 678 refuted. 0 times theorem prover too weak. 1992 trivial. 0 not checked. [2025-02-06 13:31:16,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:31:17,579 INFO L134 CoverageAnalysis]: Checked inductivity of 5013 backedges. 2343 proven. 678 refuted. 0 times theorem prover too weak. 1992 trivial. 0 not checked. [2025-02-06 13:31:17,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167755631] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:31:17,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:31:17,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 43 [2025-02-06 13:31:17,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399811655] [2025-02-06 13:31:17,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:31:17,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-02-06 13:31:17,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:31:17,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-02-06 13:31:17,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=1545, Unknown=0, NotChecked=0, Total=1892 [2025-02-06 13:31:17,584 INFO L87 Difference]: Start difference. First operand 265 states and 280 transitions. Second operand has 44 states, 43 states have (on average 2.2325581395348837) internal successors, (96), 40 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 13:31:18,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:31:18,963 INFO L93 Difference]: Finished difference Result 947 states and 1070 transitions. [2025-02-06 13:31:18,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2025-02-06 13:31:18,963 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.2325581395348837) internal successors, (96), 40 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) Word has length 280 [2025-02-06 13:31:18,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:31:18,970 INFO L225 Difference]: With dead ends: 947 [2025-02-06 13:31:18,970 INFO L226 Difference]: Without dead ends: 827 [2025-02-06 13:31:18,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 537 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4731 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2981, Invalid=11299, Unknown=0, NotChecked=0, Total=14280 [2025-02-06 13:31:18,976 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:31:18,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:31:18,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2025-02-06 13:31:19,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 328. [2025-02-06 13:31:19,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 313 states have (on average 1.1022364217252396) internal successors, (345), 313 states have internal predecessors, (345), 3 states have call successors, (3), 2 states have call predecessors, (3), 11 states have return successors, (12), 12 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 13:31:19,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 360 transitions. [2025-02-06 13:31:19,022 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 360 transitions. Word has length 280 [2025-02-06 13:31:19,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:31:19,023 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 360 transitions. [2025-02-06 13:31:19,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.2325581395348837) internal successors, (96), 40 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 13:31:19,023 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 360 transitions. [2025-02-06 13:31:19,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2025-02-06 13:31:19,025 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:31:19,025 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 14, 13, 13, 13, 13, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2025-02-06 13:31:19,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-06 13:31:19,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-06 13:31:19,226 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:31:19,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:31:19,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1431471179, now seen corresponding path program 10 times [2025-02-06 13:31:19,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:31:19,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481604991] [2025-02-06 13:31:19,227 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 13:31:19,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:31:19,239 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 341 statements into 2 equivalence classes. [2025-02-06 13:31:19,343 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 341 of 341 statements. [2025-02-06 13:31:19,343 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 13:31:19,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:31:20,221 INFO L134 CoverageAnalysis]: Checked inductivity of 8328 backedges. 4040 proven. 137 refuted. 0 times theorem prover too weak. 4151 trivial. 0 not checked. [2025-02-06 13:31:20,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:31:20,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481604991] [2025-02-06 13:31:20,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481604991] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:31:20,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568148357] [2025-02-06 13:31:20,221 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 13:31:20,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:31:20,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:31:20,224 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:31:20,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-06 13:31:20,390 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 341 statements into 2 equivalence classes. [2025-02-06 13:31:20,461 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 341 of 341 statements. [2025-02-06 13:31:20,461 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 13:31:20,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:31:20,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-06 13:31:20,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:31:20,820 INFO L134 CoverageAnalysis]: Checked inductivity of 8328 backedges. 3597 proven. 765 refuted. 0 times theorem prover too weak. 3966 trivial. 0 not checked. [2025-02-06 13:31:20,820 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:31:24,672 INFO L134 CoverageAnalysis]: Checked inductivity of 8328 backedges. 3597 proven. 765 refuted. 0 times theorem prover too weak. 3966 trivial. 0 not checked. [2025-02-06 13:31:24,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568148357] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:31:24,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:31:24,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 35, 35] total 46 [2025-02-06 13:31:24,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543387873] [2025-02-06 13:31:24,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:31:24,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-02-06 13:31:24,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:31:24,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-02-06 13:31:24,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1863, Unknown=0, NotChecked=0, Total=2070 [2025-02-06 13:31:24,674 INFO L87 Difference]: Start difference. First operand 328 states and 360 transitions. Second operand has 46 states, 46 states have (on average 2.369565217391304) internal successors, (109), 39 states have internal predecessors, (109), 1 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (9), 9 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 13:31:25,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:31:25,305 INFO L93 Difference]: Finished difference Result 590 states and 654 transitions. [2025-02-06 13:31:25,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2025-02-06 13:31:25,306 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.369565217391304) internal successors, (109), 39 states have internal predecessors, (109), 1 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (9), 9 states have call predecessors, (9), 1 states have call successors, (9) Word has length 341 [2025-02-06 13:31:25,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:31:25,308 INFO L225 Difference]: With dead ends: 590 [2025-02-06 13:31:25,308 INFO L226 Difference]: Without dead ends: 352 [2025-02-06 13:31:25,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 633 SyntacticMatches, 32 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3891 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1068, Invalid=7488, Unknown=0, NotChecked=0, Total=8556 [2025-02-06 13:31:25,311 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:31:25,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 313 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:31:25,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-02-06 13:31:25,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2025-02-06 13:31:25,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 336 states have (on average 1.0922619047619047) internal successors, (367), 336 states have internal predecessors, (367), 3 states have call successors, (3), 2 states have call predecessors, (3), 12 states have return successors, (13), 13 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 13:31:25,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 383 transitions. [2025-02-06 13:31:25,384 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 383 transitions. Word has length 341 [2025-02-06 13:31:25,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:31:25,384 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 383 transitions. [2025-02-06 13:31:25,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.369565217391304) internal successors, (109), 39 states have internal predecessors, (109), 1 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (9), 9 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 13:31:25,385 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 383 transitions. [2025-02-06 13:31:25,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2025-02-06 13:31:25,388 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:31:25,388 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 15, 14, 14, 14, 14, 12, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1] [2025-02-06 13:31:25,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-06 13:31:25,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 13:31:25,589 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:31:25,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:31:25,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1267495436, now seen corresponding path program 11 times [2025-02-06 13:31:25,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:31:25,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251416711] [2025-02-06 13:31:25,590 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 13:31:25,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:31:25,603 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 370 statements into 17 equivalence classes. [2025-02-06 13:31:25,660 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) and asserted 327 of 370 statements. [2025-02-06 13:31:25,660 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2025-02-06 13:31:25,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:31:26,577 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 5962 proven. 788 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-02-06 13:31:26,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:31:26,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251416711] [2025-02-06 13:31:26,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251416711] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:31:26,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576338610] [2025-02-06 13:31:26,578 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 13:31:26,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:31:26,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:31:26,581 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:31:26,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-06 13:31:26,827 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 370 statements into 17 equivalence classes. [2025-02-06 13:31:26,905 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) and asserted 327 of 370 statements. [2025-02-06 13:31:26,905 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2025-02-06 13:31:26,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:31:26,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-06 13:31:26,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:31:27,138 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 5993 proven. 826 refuted. 0 times theorem prover too weak. 3051 trivial. 0 not checked. [2025-02-06 13:31:27,139 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:31:30,950 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 6107 proven. 712 refuted. 0 times theorem prover too weak. 3051 trivial. 0 not checked. [2025-02-06 13:31:30,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576338610] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:31:30,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:31:30,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 38, 38] total 45 [2025-02-06 13:31:30,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418697112] [2025-02-06 13:31:30,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:31:30,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-02-06 13:31:30,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:31:30,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-02-06 13:31:30,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1761, Unknown=0, NotChecked=0, Total=1980 [2025-02-06 13:31:30,952 INFO L87 Difference]: Start difference. First operand 352 states and 383 transitions. Second operand has 45 states, 45 states have (on average 2.466666666666667) internal successors, (111), 39 states have internal predecessors, (111), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 13:31:32,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:31:32,482 INFO L93 Difference]: Finished difference Result 590 states and 652 transitions. [2025-02-06 13:31:32,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2025-02-06 13:31:32,483 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.466666666666667) internal successors, (111), 39 states have internal predecessors, (111), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) Word has length 370 [2025-02-06 13:31:32,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:31:32,485 INFO L225 Difference]: With dead ends: 590 [2025-02-06 13:31:32,485 INFO L226 Difference]: Without dead ends: 355 [2025-02-06 13:31:32,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 838 GetRequests, 698 SyntacticMatches, 33 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3960 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1642, Invalid=10130, Unknown=0, NotChecked=0, Total=11772 [2025-02-06 13:31:32,488 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 1715 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 13:31:32,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 532 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1715 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 13:31:32,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-02-06 13:31:32,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2025-02-06 13:31:32,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 339 states have (on average 1.0678466076696165) internal successors, (362), 339 states have internal predecessors, (362), 3 states have call successors, (3), 2 states have call predecessors, (3), 12 states have return successors, (13), 13 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 13:31:32,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 378 transitions. [2025-02-06 13:31:32,535 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 378 transitions. Word has length 370 [2025-02-06 13:31:32,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:31:32,536 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 378 transitions. [2025-02-06 13:31:32,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.466666666666667) internal successors, (111), 39 states have internal predecessors, (111), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 13:31:32,536 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 378 transitions. [2025-02-06 13:31:32,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-02-06 13:31:32,538 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:31:32,538 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 15, 14, 14, 14, 14, 12, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1] [2025-02-06 13:31:32,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-06 13:31:32,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:31:32,739 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:31:32,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:31:32,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1217000068, now seen corresponding path program 12 times [2025-02-06 13:31:32,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:31:32,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014134598] [2025-02-06 13:31:32,740 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 13:31:32,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:31:32,756 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 373 statements into 17 equivalence classes. [2025-02-06 13:31:32,831 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) and asserted 373 of 373 statements. [2025-02-06 13:31:32,831 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2025-02-06 13:31:32,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:31:33,563 INFO L134 CoverageAnalysis]: Checked inductivity of 10104 backedges. 2656 proven. 247 refuted. 0 times theorem prover too weak. 7201 trivial. 0 not checked. [2025-02-06 13:31:33,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:31:33,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014134598] [2025-02-06 13:31:33,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014134598] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:31:33,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181702548] [2025-02-06 13:31:33,563 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 13:31:33,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:31:33,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:31:33,567 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:31:33,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-06 13:31:33,830 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 373 statements into 17 equivalence classes. [2025-02-06 13:31:33,945 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) and asserted 373 of 373 statements. [2025-02-06 13:31:33,945 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2025-02-06 13:31:33,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:31:33,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 833 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 13:31:33,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:31:34,438 INFO L134 CoverageAnalysis]: Checked inductivity of 10104 backedges. 2558 proven. 5849 refuted. 0 times theorem prover too weak. 1697 trivial. 0 not checked. [2025-02-06 13:31:34,438 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:31:38,801 INFO L134 CoverageAnalysis]: Checked inductivity of 10104 backedges. 2558 proven. 5849 refuted. 0 times theorem prover too weak. 1697 trivial. 0 not checked. [2025-02-06 13:31:38,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181702548] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:31:38,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:31:38,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31, 31] total 78 [2025-02-06 13:31:38,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024775895] [2025-02-06 13:31:38,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:31:38,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2025-02-06 13:31:38,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:31:38,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2025-02-06 13:31:38,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=834, Invalid=5328, Unknown=0, NotChecked=0, Total=6162 [2025-02-06 13:31:38,805 INFO L87 Difference]: Start difference. First operand 355 states and 378 transitions. Second operand has 79 states, 78 states have (on average 2.269230769230769) internal successors, (177), 67 states have internal predecessors, (177), 1 states have call successors, (2), 1 states have call predecessors, (2), 13 states have return successors, (13), 13 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 13:31:50,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:31:50,335 INFO L93 Difference]: Finished difference Result 1572 states and 1797 transitions. [2025-02-06 13:31:50,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 408 states. [2025-02-06 13:31:50,335 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 78 states have (on average 2.269230769230769) internal successors, (177), 67 states have internal predecessors, (177), 1 states have call successors, (2), 1 states have call predecessors, (2), 13 states have return successors, (13), 13 states have call predecessors, (13), 1 states have call successors, (13) Word has length 373 [2025-02-06 13:31:50,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:31:50,340 INFO L225 Difference]: With dead ends: 1572 [2025-02-06 13:31:50,341 INFO L226 Difference]: Without dead ends: 1158 [2025-02-06 13:31:50,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1103 GetRequests, 696 SyntacticMatches, 0 SemanticMatches, 407 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70292 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=30406, Invalid=136466, Unknown=0, NotChecked=0, Total=166872 [2025-02-06 13:31:50,354 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 13:31:50,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 13:31:50,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2025-02-06 13:31:50,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 787. [2025-02-06 13:31:50,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 764 states have (on average 1.1282722513089005) internal successors, (862), 764 states have internal predecessors, (862), 3 states have call successors, (3), 2 states have call predecessors, (3), 19 states have return successors, (20), 20 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 13:31:50,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 885 transitions. [2025-02-06 13:31:50,438 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 885 transitions. Word has length 373 [2025-02-06 13:31:50,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:31:50,439 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 885 transitions. [2025-02-06 13:31:50,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 78 states have (on average 2.269230769230769) internal successors, (177), 67 states have internal predecessors, (177), 1 states have call successors, (2), 1 states have call predecessors, (2), 13 states have return successors, (13), 13 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 13:31:50,439 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 885 transitions. [2025-02-06 13:31:50,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 813 [2025-02-06 13:31:50,445 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:31:50,445 INFO L218 NwaCegarLoop]: trace histogram [199, 199, 199, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 1, 1, 1, 1, 1, 1] [2025-02-06 13:31:50,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-06 13:31:50,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:31:50,650 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:31:50,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:31:50,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1701151401, now seen corresponding path program 13 times [2025-02-06 13:31:50,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:31:50,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858505285] [2025-02-06 13:31:50,651 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 13:31:50,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:31:50,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 812 statements into 1 equivalence classes. [2025-02-06 13:31:50,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 812 of 812 statements. [2025-02-06 13:31:50,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:31:50,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:31:54,591 INFO L134 CoverageAnalysis]: Checked inductivity of 64803 backedges. 31011 proven. 9572 refuted. 0 times theorem prover too weak. 24220 trivial. 0 not checked. [2025-02-06 13:31:54,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:31:54,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858505285] [2025-02-06 13:31:54,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858505285] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:31:54,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915191860] [2025-02-06 13:31:54,592 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 13:31:54,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:31:54,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:31:54,594 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:31:54,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-06 13:31:54,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 812 statements into 1 equivalence classes. [2025-02-06 13:31:55,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 812 of 812 statements. [2025-02-06 13:31:55,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:31:55,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:31:55,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 1844 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-02-06 13:31:55,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:31:55,402 INFO L134 CoverageAnalysis]: Checked inductivity of 64803 backedges. 31045 proven. 9531 refuted. 0 times theorem prover too weak. 24227 trivial. 0 not checked. [2025-02-06 13:31:55,402 INFO L312 TraceCheckSpWp]: Computing backward predicates...