./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-tiling/mbpr3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-tiling/mbpr3.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a50e57e46342104030586dde3ea26bc2e3984490f4fdef34fa383d24842d8980 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:49:36,896 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:49:36,944 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 08:49:36,949 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:49:36,949 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:49:36,970 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:49:36,971 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:49:36,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:49:36,971 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:49:36,972 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:49:36,972 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:49:36,972 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:49:36,972 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:49:36,972 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:49:36,973 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:49:36,973 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:49:36,973 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 08:49:36,973 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:49:36,973 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:49:36,973 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:49:36,974 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:49:36,974 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 08:49:36,974 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:49:36,974 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 08:49:36,974 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 08:49:36,974 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:49:36,974 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:49:36,974 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 08:49:36,974 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:49:36,974 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:49:36,974 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:49:36,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:49:36,975 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:49:36,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:49:36,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:49:36,975 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:49:36,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:49:36,975 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 08:49:36,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 08:49:36,975 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:49:36,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:49:36,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:49:36,976 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:49:36,976 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:49:36,976 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:49:36,976 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a50e57e46342104030586dde3ea26bc2e3984490f4fdef34fa383d24842d8980 [2025-02-08 08:49:37,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:49:37,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:49:37,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:49:37,203 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:49:37,203 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:49:37,205 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/mbpr3.c [2025-02-08 08:49:38,295 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/480bb3d3f/6b69c0def58241c19aa5948116f49475/FLAG24ad89180 [2025-02-08 08:49:38,532 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:49:38,536 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr3.c [2025-02-08 08:49:38,541 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/480bb3d3f/6b69c0def58241c19aa5948116f49475/FLAG24ad89180 [2025-02-08 08:49:38,863 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/480bb3d3f/6b69c0def58241c19aa5948116f49475 [2025-02-08 08:49:38,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:49:38,867 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:49:38,869 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:49:38,870 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:49:38,872 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:49:38,873 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:49:38" (1/1) ... [2025-02-08 08:49:38,875 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36eb96ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:38, skipping insertion in model container [2025-02-08 08:49:38,875 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:49:38" (1/1) ... [2025-02-08 08:49:38,887 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:49:39,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:49:39,012 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:49:39,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:49:39,049 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:49:39,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:39 WrapperNode [2025-02-08 08:49:39,050 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:49:39,051 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:49:39,052 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:49:39,052 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:49:39,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:39" (1/1) ... [2025-02-08 08:49:39,064 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:39" (1/1) ... [2025-02-08 08:49:39,093 INFO L138 Inliner]: procedures = 15, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 197 [2025-02-08 08:49:39,093 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:49:39,094 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:49:39,094 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:49:39,094 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:49:39,100 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:39" (1/1) ... [2025-02-08 08:49:39,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:39" (1/1) ... [2025-02-08 08:49:39,102 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:39" (1/1) ... [2025-02-08 08:49:39,116 INFO L175 MemorySlicer]: Split 30 memory accesses to 3 slices as follows [2, 8, 20]. 67 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0]. The 12 writes are split as follows [0, 0, 12]. [2025-02-08 08:49:39,116 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:39" (1/1) ... [2025-02-08 08:49:39,116 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:39" (1/1) ... [2025-02-08 08:49:39,123 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:39" (1/1) ... [2025-02-08 08:49:39,124 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:39" (1/1) ... [2025-02-08 08:49:39,129 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:39" (1/1) ... [2025-02-08 08:49:39,129 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:39" (1/1) ... [2025-02-08 08:49:39,131 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:49:39,131 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:49:39,132 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:49:39,132 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:49:39,132 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:39" (1/1) ... [2025-02-08 08:49:39,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:49:39,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:49:39,159 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:49:39,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:49:39,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:49:39,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:49:39,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:49:39,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 08:49:39,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 08:49:39,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:49:39,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:49:39,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 08:49:39,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:49:39,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:49:39,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:49:39,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:49:39,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 08:49:39,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 08:49:39,233 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:49:39,234 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:49:39,551 INFO L? ?]: Removed 97 outVars from TransFormulas that were not future-live. [2025-02-08 08:49:39,551 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:49:39,564 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:49:39,566 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:49:39,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:49:39 BoogieIcfgContainer [2025-02-08 08:49:39,566 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:49:39,568 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:49:39,568 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:49:39,571 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:49:39,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:49:38" (1/3) ... [2025-02-08 08:49:39,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f15ea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:49:39, skipping insertion in model container [2025-02-08 08:49:39,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:39" (2/3) ... [2025-02-08 08:49:39,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f15ea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:49:39, skipping insertion in model container [2025-02-08 08:49:39,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:49:39" (3/3) ... [2025-02-08 08:49:39,573 INFO L128 eAbstractionObserver]: Analyzing ICFG mbpr3.c [2025-02-08 08:49:39,583 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:49:39,585 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mbpr3.c that has 1 procedures, 198 locations, 1 initial locations, 4 loop locations, and 86 error locations. [2025-02-08 08:49:39,624 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:49:39,631 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;@5d34872b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:49:39,631 INFO L334 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2025-02-08 08:49:39,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 110 states have (on average 1.9181818181818182) internal successors, (211), 197 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:39,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 08:49:39,637 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:39,637 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:39,638 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 08:49:39,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:39,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1463519216, now seen corresponding path program 1 times [2025-02-08 08:49:39,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:39,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988463963] [2025-02-08 08:49:39,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:39,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:39,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:49:39,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:49:39,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:39,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:39,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:49:39,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:39,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988463963] [2025-02-08 08:49:39,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988463963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:39,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:39,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:49:39,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50681010] [2025-02-08 08:49:39,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:39,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:49:39,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:39,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:49:39,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:49:39,779 INFO L87 Difference]: Start difference. First operand has 198 states, 110 states have (on average 1.9181818181818182) internal successors, (211), 197 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:39,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:39,799 INFO L93 Difference]: Finished difference Result 391 states and 415 transitions. [2025-02-08 08:49:39,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:49:39,801 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 08:49:39,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:39,807 INFO L225 Difference]: With dead ends: 391 [2025-02-08 08:49:39,807 INFO L226 Difference]: Without dead ends: 194 [2025-02-08 08:49:39,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:49:39,813 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:39,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:49:39,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-02-08 08:49:39,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-02-08 08:49:39,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 108 states have (on average 1.8611111111111112) internal successors, (201), 193 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:39,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 201 transitions. [2025-02-08 08:49:39,842 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 201 transitions. Word has length 7 [2025-02-08 08:49:39,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:39,842 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 201 transitions. [2025-02-08 08:49:39,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:39,842 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 201 transitions. [2025-02-08 08:49:39,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 08:49:39,842 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:39,842 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:39,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:49:39,842 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 08:49:39,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:39,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1463489425, now seen corresponding path program 1 times [2025-02-08 08:49:39,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:39,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119910190] [2025-02-08 08:49:39,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:39,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:39,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:49:39,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:49:39,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:39,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:39,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:49:39,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:39,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119910190] [2025-02-08 08:49:39,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119910190] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:39,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:39,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:49:39,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708797300] [2025-02-08 08:49:39,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:39,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:49:39,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:39,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:49:39,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:39,982 INFO L87 Difference]: Start difference. First operand 194 states and 201 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:40,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:40,034 INFO L93 Difference]: Finished difference Result 194 states and 201 transitions. [2025-02-08 08:49:40,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:49:40,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 08:49:40,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:40,038 INFO L225 Difference]: With dead ends: 194 [2025-02-08 08:49:40,038 INFO L226 Difference]: Without dead ends: 191 [2025-02-08 08:49:40,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:40,038 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 384 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:40,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 181 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:49:40,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-02-08 08:49:40,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2025-02-08 08:49:40,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 108 states have (on average 1.8333333333333333) internal successors, (198), 190 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:40,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 198 transitions. [2025-02-08 08:49:40,049 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 198 transitions. Word has length 7 [2025-02-08 08:49:40,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:40,052 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 198 transitions. [2025-02-08 08:49:40,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:40,052 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 198 transitions. [2025-02-08 08:49:40,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 08:49:40,052 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:40,052 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:40,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:49:40,052 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 08:49:40,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:40,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1876468247, now seen corresponding path program 1 times [2025-02-08 08:49:40,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:40,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449999117] [2025-02-08 08:49:40,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:40,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:40,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:49:40,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:49:40,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:40,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:40,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:49:40,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:40,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449999117] [2025-02-08 08:49:40,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449999117] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:40,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:40,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:49:40,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225692095] [2025-02-08 08:49:40,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:40,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:49:40,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:40,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:49:40,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:49:40,191 INFO L87 Difference]: Start difference. First operand 191 states and 198 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:40,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:40,235 INFO L93 Difference]: Finished difference Result 191 states and 198 transitions. [2025-02-08 08:49:40,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:49:40,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 08:49:40,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:40,236 INFO L225 Difference]: With dead ends: 191 [2025-02-08 08:49:40,236 INFO L226 Difference]: Without dead ends: 188 [2025-02-08 08:49:40,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:49:40,237 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 376 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:40,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 180 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:49:40,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-02-08 08:49:40,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2025-02-08 08:49:40,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 108 states have (on average 1.8055555555555556) internal successors, (195), 187 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:40,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 195 transitions. [2025-02-08 08:49:40,246 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 195 transitions. Word has length 8 [2025-02-08 08:49:40,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:40,246 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 195 transitions. [2025-02-08 08:49:40,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:40,246 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 195 transitions. [2025-02-08 08:49:40,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 08:49:40,246 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:40,246 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:40,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:49:40,246 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 08:49:40,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:40,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1428615581, now seen corresponding path program 1 times [2025-02-08 08:49:40,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:40,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916551948] [2025-02-08 08:49:40,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:40,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:40,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:49:40,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:49:40,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:40,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:40,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:49:40,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:40,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916551948] [2025-02-08 08:49:40,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916551948] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:40,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:40,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:49:40,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942035052] [2025-02-08 08:49:40,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:40,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:49:40,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:40,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:49:40,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:49:40,317 INFO L87 Difference]: Start difference. First operand 188 states and 195 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:40,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:40,600 INFO L93 Difference]: Finished difference Result 347 states and 360 transitions. [2025-02-08 08:49:40,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:49:40,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-08 08:49:40,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:40,601 INFO L225 Difference]: With dead ends: 347 [2025-02-08 08:49:40,601 INFO L226 Difference]: Without dead ends: 275 [2025-02-08 08:49:40,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:49:40,602 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 82 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:40,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 149 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 08:49:40,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-02-08 08:49:40,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2025-02-08 08:49:40,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 195 states have (on average 1.476923076923077) internal successors, (288), 274 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:40,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 288 transitions. [2025-02-08 08:49:40,610 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 288 transitions. Word has length 11 [2025-02-08 08:49:40,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:40,610 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 288 transitions. [2025-02-08 08:49:40,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:40,611 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 288 transitions. [2025-02-08 08:49:40,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 08:49:40,611 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:40,611 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:40,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:49:40,611 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 08:49:40,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:40,612 INFO L85 PathProgramCache]: Analyzing trace with hash -203062917, now seen corresponding path program 1 times [2025-02-08 08:49:40,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:40,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056615191] [2025-02-08 08:49:40,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:40,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:40,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 08:49:40,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 08:49:40,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:40,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:40,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:49:40,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:40,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056615191] [2025-02-08 08:49:40,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056615191] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:40,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:40,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:49:40,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020475950] [2025-02-08 08:49:40,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:40,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:49:40,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:40,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:49:40,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:40,702 INFO L87 Difference]: Start difference. First operand 275 states and 288 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:40,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:40,852 INFO L93 Difference]: Finished difference Result 284 states and 298 transitions. [2025-02-08 08:49:40,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:49:40,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-08 08:49:40,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:40,853 INFO L225 Difference]: With dead ends: 284 [2025-02-08 08:49:40,853 INFO L226 Difference]: Without dead ends: 282 [2025-02-08 08:49:40,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:40,855 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 2 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:40,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 408 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:49:40,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-02-08 08:49:40,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2025-02-08 08:49:40,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 202 states have (on average 1.4653465346534653) internal successors, (296), 281 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:40,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 296 transitions. [2025-02-08 08:49:40,870 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 296 transitions. Word has length 26 [2025-02-08 08:49:40,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:40,871 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 296 transitions. [2025-02-08 08:49:40,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:40,871 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 296 transitions. [2025-02-08 08:49:40,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-08 08:49:40,871 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:40,872 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:40,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:49:40,872 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 08:49:40,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:40,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1759011407, now seen corresponding path program 1 times [2025-02-08 08:49:40,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:40,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121061116] [2025-02-08 08:49:40,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:40,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:40,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 08:49:40,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 08:49:40,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:40,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:40,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:49:40,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:40,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121061116] [2025-02-08 08:49:40,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121061116] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:40,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:40,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:49:40,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179616252] [2025-02-08 08:49:40,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:40,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:49:40,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:40,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:49:40,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:40,950 INFO L87 Difference]: Start difference. First operand 282 states and 296 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:41,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:41,163 INFO L93 Difference]: Finished difference Result 286 states and 300 transitions. [2025-02-08 08:49:41,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:49:41,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-02-08 08:49:41,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:41,164 INFO L225 Difference]: With dead ends: 286 [2025-02-08 08:49:41,164 INFO L226 Difference]: Without dead ends: 284 [2025-02-08 08:49:41,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:41,165 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 64 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:41,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 258 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 08:49:41,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-02-08 08:49:41,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2025-02-08 08:49:41,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 204 states have (on average 1.4607843137254901) internal successors, (298), 283 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:41,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 298 transitions. [2025-02-08 08:49:41,170 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 298 transitions. Word has length 31 [2025-02-08 08:49:41,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:41,171 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 298 transitions. [2025-02-08 08:49:41,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:41,171 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 298 transitions. [2025-02-08 08:49:41,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 08:49:41,171 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:41,171 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:41,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:49:41,171 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 08:49:41,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:41,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1212055652, now seen corresponding path program 1 times [2025-02-08 08:49:41,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:41,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219188929] [2025-02-08 08:49:41,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:41,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:41,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 08:49:41,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 08:49:41,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:41,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:41,351 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:49:41,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:41,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219188929] [2025-02-08 08:49:41,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219188929] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:41,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:41,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:49:41,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767604082] [2025-02-08 08:49:41,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:41,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:49:41,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:41,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:49:41,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:49:41,353 INFO L87 Difference]: Start difference. First operand 284 states and 298 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:41,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:41,575 INFO L93 Difference]: Finished difference Result 475 states and 499 transitions. [2025-02-08 08:49:41,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:49:41,576 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-02-08 08:49:41,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:41,576 INFO L225 Difference]: With dead ends: 475 [2025-02-08 08:49:41,576 INFO L226 Difference]: Without dead ends: 284 [2025-02-08 08:49:41,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:49:41,579 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 638 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:41,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 134 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 08:49:41,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-02-08 08:49:41,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2025-02-08 08:49:41,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 204 states have (on average 1.446078431372549) internal successors, (295), 283 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:41,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 295 transitions. [2025-02-08 08:49:41,583 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 295 transitions. Word has length 33 [2025-02-08 08:49:41,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:41,584 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 295 transitions. [2025-02-08 08:49:41,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:41,584 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 295 transitions. [2025-02-08 08:49:41,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-08 08:49:41,584 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:41,584 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:41,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:49:41,584 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 08:49:41,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:41,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1671109519, now seen corresponding path program 1 times [2025-02-08 08:49:41,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:41,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012257176] [2025-02-08 08:49:41,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:41,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:41,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 08:49:41,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 08:49:41,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:41,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:41,668 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:49:41,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:41,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012257176] [2025-02-08 08:49:41,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012257176] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:49:41,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619663732] [2025-02-08 08:49:41,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:41,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:49:41,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:49:41,671 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:49:41,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 08:49:41,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 08:49:41,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 08:49:41,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:41,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:41,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:49:41,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:49:41,795 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:49:41,795 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:49:41,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619663732] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:41,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:49:41,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-08 08:49:41,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222506757] [2025-02-08 08:49:41,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:41,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:49:41,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:41,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:49:41,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:49:41,797 INFO L87 Difference]: Start difference. First operand 284 states and 295 transitions. Second operand has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:42,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:42,046 INFO L93 Difference]: Finished difference Result 284 states and 295 transitions. [2025-02-08 08:49:42,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:49:42,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-02-08 08:49:42,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:42,048 INFO L225 Difference]: With dead ends: 284 [2025-02-08 08:49:42,048 INFO L226 Difference]: Without dead ends: 271 [2025-02-08 08:49:42,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:49:42,049 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 87 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:42,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 230 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 08:49:42,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-02-08 08:49:42,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2025-02-08 08:49:42,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 204 states have (on average 1.3823529411764706) internal successors, (282), 270 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:42,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 282 transitions. [2025-02-08 08:49:42,057 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 282 transitions. Word has length 38 [2025-02-08 08:49:42,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:42,058 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 282 transitions. [2025-02-08 08:49:42,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:42,058 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 282 transitions. [2025-02-08 08:49:42,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-08 08:49:42,059 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:42,059 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:42,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 08:49:42,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:49:42,260 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 08:49:42,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:42,261 INFO L85 PathProgramCache]: Analyzing trace with hash -264787387, now seen corresponding path program 1 times [2025-02-08 08:49:42,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:42,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90613722] [2025-02-08 08:49:42,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:42,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:42,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 08:49:42,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 08:49:42,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:42,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:42,325 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:49:42,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:42,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90613722] [2025-02-08 08:49:42,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90613722] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:49:42,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975005577] [2025-02-08 08:49:42,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:42,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:49:42,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:49:42,328 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:49:42,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 08:49:42,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 08:49:42,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 08:49:42,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:42,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:42,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:49:42,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:49:42,426 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:49:42,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:49:42,491 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:49:42,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975005577] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:49:42,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:49:42,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-08 08:49:42,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234018398] [2025-02-08 08:49:42,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:49:42,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:49:42,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:42,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:49:42,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:49:42,494 INFO L87 Difference]: Start difference. First operand 271 states and 282 transitions. Second operand has 10 states, 9 states have (on average 11.333333333333334) internal successors, (102), 10 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:42,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:42,875 INFO L93 Difference]: Finished difference Result 314 states and 341 transitions. [2025-02-08 08:49:42,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:49:42,876 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 11.333333333333334) internal successors, (102), 10 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-02-08 08:49:42,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:42,877 INFO L225 Difference]: With dead ends: 314 [2025-02-08 08:49:42,877 INFO L226 Difference]: Without dead ends: 281 [2025-02-08 08:49:42,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:49:42,878 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 283 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:42,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 247 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 08:49:42,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-02-08 08:49:42,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 279. [2025-02-08 08:49:42,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 242 states have (on average 1.2148760330578512) internal successors, (294), 278 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:42,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 294 transitions. [2025-02-08 08:49:42,884 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 294 transitions. Word has length 39 [2025-02-08 08:49:42,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:42,884 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 294 transitions. [2025-02-08 08:49:42,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 11.333333333333334) internal successors, (102), 10 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:42,885 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 294 transitions. [2025-02-08 08:49:42,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-08 08:49:42,886 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:42,886 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:42,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 08:49:43,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:49:43,087 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 08:49:43,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:43,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1148615023, now seen corresponding path program 1 times [2025-02-08 08:49:43,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:43,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671671456] [2025-02-08 08:49:43,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:43,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:43,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 08:49:43,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 08:49:43,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:43,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:43,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:49:43,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:43,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671671456] [2025-02-08 08:49:43,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671671456] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:43,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:43,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:49:43,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997515201] [2025-02-08 08:49:43,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:43,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:49:43,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:43,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:49:43,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:43,154 INFO L87 Difference]: Start difference. First operand 279 states and 294 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:43,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:43,319 INFO L93 Difference]: Finished difference Result 285 states and 300 transitions. [2025-02-08 08:49:43,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:49:43,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-02-08 08:49:43,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:43,321 INFO L225 Difference]: With dead ends: 285 [2025-02-08 08:49:43,322 INFO L226 Difference]: Without dead ends: 283 [2025-02-08 08:49:43,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:43,322 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 64 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:43,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 177 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 08:49:43,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-02-08 08:49:43,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 282. [2025-02-08 08:49:43,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 245 states have (on average 1.2122448979591838) internal successors, (297), 281 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:43,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 297 transitions. [2025-02-08 08:49:43,330 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 297 transitions. Word has length 63 [2025-02-08 08:49:43,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:43,331 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 297 transitions. [2025-02-08 08:49:43,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:43,331 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 297 transitions. [2025-02-08 08:49:43,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-08 08:49:43,332 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:43,332 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:43,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:49:43,332 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 08:49:43,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:43,333 INFO L85 PathProgramCache]: Analyzing trace with hash -696957774, now seen corresponding path program 1 times [2025-02-08 08:49:43,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:43,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306457547] [2025-02-08 08:49:43,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:43,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:43,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-08 08:49:43,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-08 08:49:43,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:43,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:43,428 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:49:43,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:43,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306457547] [2025-02-08 08:49:43,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306457547] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:49:43,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626537554] [2025-02-08 08:49:43,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:43,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:49:43,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:49:43,431 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:49:43,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 08:49:43,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-08 08:49:43,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-08 08:49:43,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:43,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:43,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:49:43,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:49:43,514 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:49:43,514 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:49:43,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626537554] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:43,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:49:43,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-08 08:49:43,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688317811] [2025-02-08 08:49:43,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:43,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:49:43,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:43,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:49:43,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:49:43,515 INFO L87 Difference]: Start difference. First operand 282 states and 297 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:43,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:43,715 INFO L93 Difference]: Finished difference Result 283 states and 298 transitions. [2025-02-08 08:49:43,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:49:43,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-02-08 08:49:43,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:43,716 INFO L225 Difference]: With dead ends: 283 [2025-02-08 08:49:43,716 INFO L226 Difference]: Without dead ends: 270 [2025-02-08 08:49:43,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:49:43,717 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 87 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:43,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 176 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 08:49:43,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-02-08 08:49:43,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2025-02-08 08:49:43,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 245 states have (on average 1.1591836734693877) internal successors, (284), 268 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:43,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 284 transitions. [2025-02-08 08:49:43,722 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 284 transitions. Word has length 70 [2025-02-08 08:49:43,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:43,722 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 284 transitions. [2025-02-08 08:49:43,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:43,722 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 284 transitions. [2025-02-08 08:49:43,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-08 08:49:43,722 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:43,722 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:43,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 08:49:43,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:49:43,923 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 08:49:43,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:43,923 INFO L85 PathProgramCache]: Analyzing trace with hash -130854427, now seen corresponding path program 1 times [2025-02-08 08:49:43,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:43,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707632764] [2025-02-08 08:49:43,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:43,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:43,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 08:49:43,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 08:49:43,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:43,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:44,011 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:49:44,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:44,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707632764] [2025-02-08 08:49:44,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707632764] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:49:44,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239490511] [2025-02-08 08:49:44,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:44,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:49:44,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:49:44,014 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:49:44,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 08:49:44,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 08:49:44,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 08:49:44,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:44,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:44,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:49:44,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:49:44,114 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:49:44,114 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:49:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:49:44,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239490511] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:49:44,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:49:44,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-08 08:49:44,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450641217] [2025-02-08 08:49:44,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:49:44,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:49:44,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:44,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:49:44,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:49:44,160 INFO L87 Difference]: Start difference. First operand 269 states and 284 transitions. Second operand has 10 states, 9 states have (on average 14.555555555555555) internal successors, (131), 10 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:44,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:44,401 INFO L93 Difference]: Finished difference Result 313 states and 334 transitions. [2025-02-08 08:49:44,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:49:44,402 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 14.555555555555555) internal successors, (131), 10 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-02-08 08:49:44,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:44,403 INFO L225 Difference]: With dead ends: 313 [2025-02-08 08:49:44,403 INFO L226 Difference]: Without dead ends: 310 [2025-02-08 08:49:44,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:49:44,403 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 225 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:44,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 211 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 08:49:44,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-02-08 08:49:44,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309. [2025-02-08 08:49:44,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 285 states have (on average 1.1508771929824562) internal successors, (328), 308 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:44,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 328 transitions. [2025-02-08 08:49:44,410 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 328 transitions. Word has length 71 [2025-02-08 08:49:44,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:44,410 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 328 transitions. [2025-02-08 08:49:44,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 14.555555555555555) internal successors, (131), 10 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:44,410 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 328 transitions. [2025-02-08 08:49:44,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-08 08:49:44,411 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:44,411 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:44,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 08:49:44,611 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,SelfDestructingSolverStorable11 [2025-02-08 08:49:44,611 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 08:49:44,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:44,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1789413567, now seen corresponding path program 1 times [2025-02-08 08:49:44,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:44,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679236515] [2025-02-08 08:49:44,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:44,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:44,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-08 08:49:44,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 08:49:44,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:44,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:44,658 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-08 08:49:44,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:44,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679236515] [2025-02-08 08:49:44,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679236515] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:44,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:44,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:49:44,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27097339] [2025-02-08 08:49:44,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:44,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:49:44,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:44,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:49:44,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:44,660 INFO L87 Difference]: Start difference. First operand 309 states and 328 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:44,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:44,781 INFO L93 Difference]: Finished difference Result 309 states and 328 transitions. [2025-02-08 08:49:44,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:49:44,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-02-08 08:49:44,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:44,782 INFO L225 Difference]: With dead ends: 309 [2025-02-08 08:49:44,782 INFO L226 Difference]: Without dead ends: 308 [2025-02-08 08:49:44,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:44,783 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 74 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:44,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 123 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:49:44,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-02-08 08:49:44,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2025-02-08 08:49:44,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 285 states have (on average 1.1473684210526316) internal successors, (327), 307 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:44,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 327 transitions. [2025-02-08 08:49:44,788 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 327 transitions. Word has length 86 [2025-02-08 08:49:44,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:44,788 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 327 transitions. [2025-02-08 08:49:44,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:44,788 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 327 transitions. [2025-02-08 08:49:44,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-08 08:49:44,788 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:44,788 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:44,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 08:49:44,790 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 08:49:44,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:44,791 INFO L85 PathProgramCache]: Analyzing trace with hash -419892859, now seen corresponding path program 2 times [2025-02-08 08:49:44,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:44,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001937626] [2025-02-08 08:49:44,791 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:49:44,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:44,801 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes. [2025-02-08 08:49:44,805 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 93 statements. [2025-02-08 08:49:44,805 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:49:44,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:44,893 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-02-08 08:49:44,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:44,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001937626] [2025-02-08 08:49:44,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001937626] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:49:44,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090414906] [2025-02-08 08:49:44,893 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:49:44,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:49:44,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:49:44,895 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:49:44,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 08:49:44,930 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes. [2025-02-08 08:49:44,937 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 93 statements. [2025-02-08 08:49:44,937 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:49:44,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:44,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:49:44,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:49:45,164 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-02-08 08:49:45,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:49:45,305 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-02-08 08:49:45,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090414906] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:49:45,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:49:45,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 2] total 7 [2025-02-08 08:49:45,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968793364] [2025-02-08 08:49:45,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:49:45,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:49:45,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:45,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:49:45,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:49:45,307 INFO L87 Difference]: Start difference. First operand 308 states and 327 transitions. Second operand has 9 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:45,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:45,436 INFO L93 Difference]: Finished difference Result 308 states and 327 transitions. [2025-02-08 08:49:45,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:49:45,436 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-02-08 08:49:45,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:45,437 INFO L225 Difference]: With dead ends: 308 [2025-02-08 08:49:45,437 INFO L226 Difference]: Without dead ends: 302 [2025-02-08 08:49:45,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:49:45,438 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 431 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:45,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 47 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:49:45,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-02-08 08:49:45,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 226. [2025-02-08 08:49:45,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 209 states have (on average 1.138755980861244) internal successors, (238), 225 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:45,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 238 transitions. [2025-02-08 08:49:45,444 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 238 transitions. Word has length 93 [2025-02-08 08:49:45,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:45,444 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 238 transitions. [2025-02-08 08:49:45,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:45,444 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 238 transitions. [2025-02-08 08:49:45,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-08 08:49:45,445 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:45,445 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:45,451 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-08 08:49:45,645 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,SelfDestructingSolverStorable13 [2025-02-08 08:49:45,646 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 08:49:45,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:45,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1988636017, now seen corresponding path program 1 times [2025-02-08 08:49:45,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:45,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259586928] [2025-02-08 08:49:45,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:45,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:45,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 08:49:45,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 08:49:45,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:45,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:45,714 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 08:49:45,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:45,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259586928] [2025-02-08 08:49:45,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259586928] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:45,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:45,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:49:45,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119013740] [2025-02-08 08:49:45,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:45,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:49:45,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:45,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:49:45,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:49:45,715 INFO L87 Difference]: Start difference. First operand 226 states and 238 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:45,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:45,724 INFO L93 Difference]: Finished difference Result 297 states and 313 transitions. [2025-02-08 08:49:45,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:49:45,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-02-08 08:49:45,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:45,726 INFO L225 Difference]: With dead ends: 297 [2025-02-08 08:49:45,726 INFO L226 Difference]: Without dead ends: 216 [2025-02-08 08:49:45,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:49:45,726 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:45,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 119 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:49:45,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-02-08 08:49:45,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2025-02-08 08:49:45,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 201 states have (on average 1.1243781094527363) internal successors, (226), 215 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:45,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 226 transitions. [2025-02-08 08:49:45,730 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 226 transitions. Word has length 95 [2025-02-08 08:49:45,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:45,731 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 226 transitions. [2025-02-08 08:49:45,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:45,731 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 226 transitions. [2025-02-08 08:49:45,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-08 08:49:45,731 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:45,731 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:45,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 08:49:45,732 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 08:49:45,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:45,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1136003886, now seen corresponding path program 1 times [2025-02-08 08:49:45,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:45,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976827385] [2025-02-08 08:49:45,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:45,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:45,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 08:49:45,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 08:49:45,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:45,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:45,797 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 08:49:45,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:45,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976827385] [2025-02-08 08:49:45,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976827385] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:45,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:45,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:49:45,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435003537] [2025-02-08 08:49:45,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:45,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:49:45,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:45,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:49:45,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:45,799 INFO L87 Difference]: Start difference. First operand 216 states and 226 transitions. Second operand has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:45,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:45,942 INFO L93 Difference]: Finished difference Result 246 states and 257 transitions. [2025-02-08 08:49:45,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:49:45,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-02-08 08:49:45,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:45,943 INFO L225 Difference]: With dead ends: 246 [2025-02-08 08:49:45,943 INFO L226 Difference]: Without dead ends: 244 [2025-02-08 08:49:45,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:45,944 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 59 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:45,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 128 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:49:45,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-02-08 08:49:45,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 219. [2025-02-08 08:49:45,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 204 states have (on average 1.1225490196078431) internal successors, (229), 218 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:45,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 229 transitions. [2025-02-08 08:49:45,949 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 229 transitions. Word has length 95 [2025-02-08 08:49:45,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:45,949 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 229 transitions. [2025-02-08 08:49:45,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:45,949 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 229 transitions. [2025-02-08 08:49:45,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-08 08:49:45,949 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:45,950 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:45,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 08:49:45,950 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 08:49:45,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:45,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1711158885, now seen corresponding path program 1 times [2025-02-08 08:49:45,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:45,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951317557] [2025-02-08 08:49:45,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:45,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:45,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 08:49:45,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 08:49:45,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:45,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:46,027 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 08:49:46,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:46,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951317557] [2025-02-08 08:49:46,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951317557] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:49:46,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048088533] [2025-02-08 08:49:46,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:46,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:49:46,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:49:46,030 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:49:46,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 08:49:46,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 08:49:46,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 08:49:46,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:46,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:46,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:49:46,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:49:46,132 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 08:49:46,132 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:49:46,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048088533] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:46,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:49:46,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-08 08:49:46,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835612181] [2025-02-08 08:49:46,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:46,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:49:46,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:46,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:49:46,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:49:46,133 INFO L87 Difference]: Start difference. First operand 219 states and 229 transitions. Second operand has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:46,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:46,300 INFO L93 Difference]: Finished difference Result 244 states and 255 transitions. [2025-02-08 08:49:46,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:49:46,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2025-02-08 08:49:46,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:46,302 INFO L225 Difference]: With dead ends: 244 [2025-02-08 08:49:46,302 INFO L226 Difference]: Without dead ends: 233 [2025-02-08 08:49:46,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:49:46,303 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 77 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:46,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 131 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 08:49:46,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-02-08 08:49:46,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 208. [2025-02-08 08:49:46,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 204 states have (on average 1.0686274509803921) internal successors, (218), 207 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:46,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 218 transitions. [2025-02-08 08:49:46,307 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 218 transitions. Word has length 102 [2025-02-08 08:49:46,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:46,307 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 218 transitions. [2025-02-08 08:49:46,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:46,307 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 218 transitions. [2025-02-08 08:49:46,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-08 08:49:46,309 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:46,309 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:46,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 08:49:46,509 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,SelfDestructingSolverStorable16 [2025-02-08 08:49:46,510 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 08:49:46,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:46,510 INFO L85 PathProgramCache]: Analyzing trace with hash 18945844, now seen corresponding path program 1 times [2025-02-08 08:49:46,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:46,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864793241] [2025-02-08 08:49:46,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:46,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:46,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-08 08:49:46,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-08 08:49:46,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:46,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:46,607 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 08:49:46,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:46,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864793241] [2025-02-08 08:49:46,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864793241] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:49:46,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016751302] [2025-02-08 08:49:46,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:46,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:49:46,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:49:46,610 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:49:46,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 08:49:46,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-08 08:49:46,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-08 08:49:46,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:46,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:46,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:49:46,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:49:46,703 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 08:49:46,703 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:49:46,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016751302] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:46,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:49:46,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-08 08:49:46,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812254330] [2025-02-08 08:49:46,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:46,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:49:46,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:46,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:49:46,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:49:46,705 INFO L87 Difference]: Start difference. First operand 208 states and 218 transitions. Second operand has 6 states, 5 states have (on average 21.0) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:46,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:46,864 INFO L93 Difference]: Finished difference Result 233 states and 244 transitions. [2025-02-08 08:49:46,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:49:46,864 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.0) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-02-08 08:49:46,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:46,865 INFO L225 Difference]: With dead ends: 233 [2025-02-08 08:49:46,865 INFO L226 Difference]: Without dead ends: 232 [2025-02-08 08:49:46,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:49:46,866 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 85 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:46,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 122 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 08:49:46,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-08 08:49:46,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 207. [2025-02-08 08:49:46,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 204 states have (on average 1.0637254901960784) internal successors, (217), 206 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:46,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 217 transitions. [2025-02-08 08:49:46,870 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 217 transitions. Word has length 114 [2025-02-08 08:49:46,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:46,870 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 217 transitions. [2025-02-08 08:49:46,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.0) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:46,871 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 217 transitions. [2025-02-08 08:49:46,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-08 08:49:46,871 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:46,871 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:46,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 08:49:47,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:49:47,072 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 08:49:47,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:47,073 INFO L85 PathProgramCache]: Analyzing trace with hash 587321136, now seen corresponding path program 1 times [2025-02-08 08:49:47,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:47,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495794288] [2025-02-08 08:49:47,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:47,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:47,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-08 08:49:47,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-08 08:49:47,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:47,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:47,152 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 08:49:47,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:47,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495794288] [2025-02-08 08:49:47,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495794288] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:49:47,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355626170] [2025-02-08 08:49:47,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:47,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:49:47,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:49:47,154 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:49:47,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 08:49:47,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-08 08:49:47,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-08 08:49:47,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:47,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:47,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:49:47,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:49:47,247 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 08:49:47,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:49:47,282 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 08:49:47,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355626170] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:49:47,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:49:47,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-08 08:49:47,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593431337] [2025-02-08 08:49:47,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:49:47,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 08:49:47,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:47,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 08:49:47,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:49:47,285 INFO L87 Difference]: Start difference. First operand 207 states and 217 transitions. Second operand has 12 states, 11 states have (on average 11.727272727272727) internal successors, (129), 12 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:47,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:47,532 INFO L93 Difference]: Finished difference Result 254 states and 270 transitions. [2025-02-08 08:49:47,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:49:47,532 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 11.727272727272727) internal successors, (129), 12 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2025-02-08 08:49:47,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:47,533 INFO L225 Difference]: With dead ends: 254 [2025-02-08 08:49:47,533 INFO L226 Difference]: Without dead ends: 253 [2025-02-08 08:49:47,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:49:47,534 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 198 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:47,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 229 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 08:49:47,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-02-08 08:49:47,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 228. [2025-02-08 08:49:47,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 225 states have (on average 1.0711111111111111) internal successors, (241), 227 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:47,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 241 transitions. [2025-02-08 08:49:47,539 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 241 transitions. Word has length 115 [2025-02-08 08:49:47,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:47,540 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 241 transitions. [2025-02-08 08:49:47,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 11.727272727272727) internal successors, (129), 12 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:47,541 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 241 transitions. [2025-02-08 08:49:47,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-08 08:49:47,544 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:47,544 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:47,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 08:49:47,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:49:47,745 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 08:49:47,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:47,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1050581504, now seen corresponding path program 1 times [2025-02-08 08:49:47,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:47,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874323880] [2025-02-08 08:49:47,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:47,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:47,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-08 08:49:47,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-08 08:49:47,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:47,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:47,796 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-08 08:49:47,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:47,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874323880] [2025-02-08 08:49:47,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874323880] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:47,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:47,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:49:47,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25366856] [2025-02-08 08:49:47,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:47,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:49:47,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:47,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:49:47,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:47,798 INFO L87 Difference]: Start difference. First operand 228 states and 241 transitions. Second operand has 4 states, 3 states have (on average 27.333333333333332) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:47,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:47,889 INFO L93 Difference]: Finished difference Result 233 states and 247 transitions. [2025-02-08 08:49:47,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:49:47,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 27.333333333333332) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2025-02-08 08:49:47,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:47,891 INFO L225 Difference]: With dead ends: 233 [2025-02-08 08:49:47,891 INFO L226 Difference]: Without dead ends: 232 [2025-02-08 08:49:47,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:47,891 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 69 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:47,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 95 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:49:47,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-08 08:49:47,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 169. [2025-02-08 08:49:47,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 167 states have (on average 1.0718562874251496) internal successors, (179), 168 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:47,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 179 transitions. [2025-02-08 08:49:47,895 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 179 transitions. Word has length 118 [2025-02-08 08:49:47,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:47,895 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 179 transitions. [2025-02-08 08:49:47,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 27.333333333333332) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:47,895 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 179 transitions. [2025-02-08 08:49:47,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-08 08:49:47,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:47,896 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:47,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 08:49:47,896 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 08:49:47,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:47,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1979517393, now seen corresponding path program 1 times [2025-02-08 08:49:47,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:47,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054692706] [2025-02-08 08:49:47,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:47,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:47,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-08 08:49:47,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-08 08:49:47,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:47,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:47,943 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 08:49:47,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:47,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054692706] [2025-02-08 08:49:47,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054692706] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:47,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:47,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:49:47,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500911578] [2025-02-08 08:49:47,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:47,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:49:47,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:47,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:49:47,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:47,945 INFO L87 Difference]: Start difference. First operand 169 states and 179 transitions. Second operand has 4 states, 3 states have (on average 37.0) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:48,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:48,047 INFO L93 Difference]: Finished difference Result 179 states and 191 transitions. [2025-02-08 08:49:48,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:49:48,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 37.0) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2025-02-08 08:49:48,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:48,048 INFO L225 Difference]: With dead ends: 179 [2025-02-08 08:49:48,048 INFO L226 Difference]: Without dead ends: 178 [2025-02-08 08:49:48,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:48,048 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 69 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:48,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 92 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:49:48,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-02-08 08:49:48,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 145. [2025-02-08 08:49:48,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.0763888888888888) internal successors, (155), 144 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:48,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2025-02-08 08:49:48,052 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 123 [2025-02-08 08:49:48,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:48,052 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2025-02-08 08:49:48,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 37.0) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:48,052 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2025-02-08 08:49:48,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-08 08:49:48,053 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:48,053 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:48,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 08:49:48,053 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 08:49:48,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:48,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1477879591, now seen corresponding path program 2 times [2025-02-08 08:49:48,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:48,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413054742] [2025-02-08 08:49:48,054 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:49:48,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:48,065 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 136 statements into 2 equivalence classes. [2025-02-08 08:49:48,070 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 136 statements. [2025-02-08 08:49:48,070 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:49:48,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:48,094 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-02-08 08:49:48,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:48,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413054742] [2025-02-08 08:49:48,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413054742] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:49:48,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117900115] [2025-02-08 08:49:48,094 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:49:48,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:49:48,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:49:48,096 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:49:48,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 08:49:48,144 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 136 statements into 2 equivalence classes. [2025-02-08 08:49:48,153 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 136 statements. [2025-02-08 08:49:48,153 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:49:48,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:48,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:49:48,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:49:48,264 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-02-08 08:49:48,264 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:49:48,378 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-02-08 08:49:48,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117900115] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:49:48,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:49:48,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-02-08 08:49:48,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066653831] [2025-02-08 08:49:48,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:49:48,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:49:48,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:48,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:49:48,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:49:48,379 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand has 5 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:48,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:48,491 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2025-02-08 08:49:48,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:49:48,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2025-02-08 08:49:48,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:48,491 INFO L225 Difference]: With dead ends: 145 [2025-02-08 08:49:48,492 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 08:49:48,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 268 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:49:48,495 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 94 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:48,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 52 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:49:48,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 08:49:48,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 08:49:48,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:48,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 08:49:48,496 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 136 [2025-02-08 08:49:48,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:48,496 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 08:49:48,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:48,496 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 08:49:48,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 08:49:48,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 86 remaining) [2025-02-08 08:49:48,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 86 remaining) [2025-02-08 08:49:48,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 86 remaining) [2025-02-08 08:49:48,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 86 remaining) [2025-02-08 08:49:48,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 86 remaining) [2025-02-08 08:49:48,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 86 remaining) [2025-02-08 08:49:48,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 86 remaining) [2025-02-08 08:49:48,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 86 remaining) [2025-02-08 08:49:48,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 86 remaining) [2025-02-08 08:49:48,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 86 remaining) [2025-02-08 08:49:48,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 86 remaining) [2025-02-08 08:49:48,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 86 remaining) [2025-02-08 08:49:48,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 86 remaining) [2025-02-08 08:49:48,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 86 remaining) [2025-02-08 08:49:48,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 86 remaining) [2025-02-08 08:49:48,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 86 remaining) [2025-02-08 08:49:48,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 86 remaining) [2025-02-08 08:49:48,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 86 remaining) [2025-02-08 08:49:48,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 86 remaining) [2025-02-08 08:49:48,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 86 remaining) [2025-02-08 08:49:48,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 86 remaining) [2025-02-08 08:49:48,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 86 remaining) [2025-02-08 08:49:48,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 86 remaining) [2025-02-08 08:49:48,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 86 remaining) [2025-02-08 08:49:48,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 86 remaining) [2025-02-08 08:49:48,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 86 remaining) [2025-02-08 08:49:48,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 86 remaining) [2025-02-08 08:49:48,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 86 remaining) [2025-02-08 08:49:48,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 86 remaining) [2025-02-08 08:49:48,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 86 remaining) [2025-02-08 08:49:48,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 86 remaining) [2025-02-08 08:49:48,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 86 remaining) [2025-02-08 08:49:48,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 86 remaining) [2025-02-08 08:49:48,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 86 remaining) [2025-02-08 08:49:48,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 86 remaining) [2025-02-08 08:49:48,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 86 remaining) [2025-02-08 08:49:48,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 86 remaining) [2025-02-08 08:49:48,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 86 remaining) [2025-02-08 08:49:48,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 86 remaining) [2025-02-08 08:49:48,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 86 remaining) [2025-02-08 08:49:48,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 86 remaining) [2025-02-08 08:49:48,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 86 remaining) [2025-02-08 08:49:48,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 86 remaining) [2025-02-08 08:49:48,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 86 remaining) [2025-02-08 08:49:48,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 86 remaining) [2025-02-08 08:49:48,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 86 remaining) [2025-02-08 08:49:48,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 86 remaining) [2025-02-08 08:49:48,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 86 remaining) [2025-02-08 08:49:48,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 86 remaining) [2025-02-08 08:49:48,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 86 remaining) [2025-02-08 08:49:48,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 86 remaining) [2025-02-08 08:49:48,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 86 remaining) [2025-02-08 08:49:48,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 86 remaining) [2025-02-08 08:49:48,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 86 remaining) [2025-02-08 08:49:48,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 86 remaining) [2025-02-08 08:49:48,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 86 remaining) [2025-02-08 08:49:48,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 86 remaining) [2025-02-08 08:49:48,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 86 remaining) [2025-02-08 08:49:48,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 86 remaining) [2025-02-08 08:49:48,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 86 remaining) [2025-02-08 08:49:48,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 86 remaining) [2025-02-08 08:49:48,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 86 remaining) [2025-02-08 08:49:48,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 86 remaining) [2025-02-08 08:49:48,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 86 remaining) [2025-02-08 08:49:48,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 86 remaining) [2025-02-08 08:49:48,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 86 remaining) [2025-02-08 08:49:48,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 86 remaining) [2025-02-08 08:49:48,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 86 remaining) [2025-02-08 08:49:48,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 86 remaining) [2025-02-08 08:49:48,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 86 remaining) [2025-02-08 08:49:48,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 86 remaining) [2025-02-08 08:49:48,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 86 remaining) [2025-02-08 08:49:48,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 86 remaining) [2025-02-08 08:49:48,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 86 remaining) [2025-02-08 08:49:48,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 86 remaining) [2025-02-08 08:49:48,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 86 remaining) [2025-02-08 08:49:48,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 86 remaining) [2025-02-08 08:49:48,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 86 remaining) [2025-02-08 08:49:48,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 86 remaining) [2025-02-08 08:49:48,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 86 remaining) [2025-02-08 08:49:48,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 86 remaining) [2025-02-08 08:49:48,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 86 remaining) [2025-02-08 08:49:48,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 86 remaining) [2025-02-08 08:49:48,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 86 remaining) [2025-02-08 08:49:48,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 86 remaining) [2025-02-08 08:49:48,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 86 remaining) [2025-02-08 08:49:48,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 08:49:48,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:49:48,704 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:48,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 08:49:48,879 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:49:48,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:49:48 BoogieIcfgContainer [2025-02-08 08:49:48,893 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:49:48,893 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:49:48,893 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:49:48,894 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:49:48,896 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:49:39" (3/4) ... [2025-02-08 08:49:48,898 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:49:48,906 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-02-08 08:49:48,909 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-08 08:49:48,909 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 08:49:48,909 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 08:49:48,910 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 08:49:48,987 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:49:48,987 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:49:48,987 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:49:48,988 INFO L158 Benchmark]: Toolchain (without parser) took 10120.99ms. Allocated memory is still 201.3MB. Free memory was 158.2MB in the beginning and 62.8MB in the end (delta: 95.4MB). Peak memory consumption was 93.2MB. Max. memory is 16.1GB. [2025-02-08 08:49:48,989 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 209.7MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:49:48,989 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.23ms. Allocated memory is still 201.3MB. Free memory was 158.2MB in the beginning and 146.0MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:49:48,991 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.52ms. Allocated memory is still 201.3MB. Free memory was 146.0MB in the beginning and 144.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:49:48,991 INFO L158 Benchmark]: Boogie Preprocessor took 37.20ms. Allocated memory is still 201.3MB. Free memory was 144.0MB in the beginning and 142.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:49:48,991 INFO L158 Benchmark]: IcfgBuilder took 435.05ms. Allocated memory is still 201.3MB. Free memory was 142.2MB in the beginning and 115.5MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 08:49:48,992 INFO L158 Benchmark]: TraceAbstraction took 9325.20ms. Allocated memory is still 201.3MB. Free memory was 115.0MB in the beginning and 70.9MB in the end (delta: 44.1MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. [2025-02-08 08:49:48,992 INFO L158 Benchmark]: Witness Printer took 93.88ms. Allocated memory is still 201.3MB. Free memory was 70.9MB in the beginning and 62.8MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:49:48,993 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 209.7MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.23ms. Allocated memory is still 201.3MB. Free memory was 158.2MB in the beginning and 146.0MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.52ms. Allocated memory is still 201.3MB. Free memory was 146.0MB in the beginning and 144.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.20ms. Allocated memory is still 201.3MB. Free memory was 144.0MB in the beginning and 142.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 435.05ms. Allocated memory is still 201.3MB. Free memory was 142.2MB in the beginning and 115.5MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9325.20ms. Allocated memory is still 201.3MB. Free memory was 115.0MB in the beginning and 70.9MB in the end (delta: 44.1MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. * Witness Printer took 93.88ms. Allocated memory is still 201.3MB. Free memory was 70.9MB in the beginning and 62.8MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 64]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 64]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 64]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 64]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 86 error locations. Started 1 CEGAR loops. OverallTime: 9.1s, OverallIterations: 22, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3506 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3506 mSDsluCounter, 3695 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1801 mSDsCounter, 263 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5650 IncrementalHoareTripleChecker+Invalid, 5913 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 263 mSolverCounterUnsat, 1894 mSDtfsCounter, 5650 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1302 GetRequests, 1214 SyntacticMatches, 3 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=309occurred in iteration=12, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 277 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 2259 NumberOfCodeBlocks, 1879 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2677 ConstructedInterpolants, 0 QuantifiedInterpolants, 6961 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1471 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 36 InterpolantComputations, 17 PerfectInterpolantSequences, 800/986 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 86 specifications checked. All of them hold - InvariantResult [Line: 56]: Location Invariant Derived location invariant: (((((((2 <= CELLCOUNT) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 3) : ((CELLCOUNT % 3) + 3)) == 0)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (2 <= i)) || ((((((2 <= CELLCOUNT) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 3) : ((CELLCOUNT % 3) + 3)) == 0)) && (i == 1)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1))) - InvariantResult [Line: 28]: Location Invariant Derived location invariant: (((((((2 <= CELLCOUNT) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 3) : ((CELLCOUNT % 3) + 3)) == 0)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (2 <= i)) || ((((((2 <= CELLCOUNT) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 3) : ((CELLCOUNT % 3) + 3)) == 0)) && (i == 1)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1))) - InvariantResult [Line: 42]: Location Invariant Derived location invariant: (((((((2 <= CELLCOUNT) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 3) : ((CELLCOUNT % 3) + 3)) == 0)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (2 <= i)) || ((((((2 <= CELLCOUNT) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 3) : ((CELLCOUNT % 3) + 3)) == 0)) && (i == 1)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1))) - InvariantResult [Line: 70]: Location Invariant Derived location invariant: (((((((1 <= i) && (2 <= CELLCOUNT)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 3) : ((CELLCOUNT % 3) + 3)) == 0)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) || ((((((i == 0) && (2 <= CELLCOUNT)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 3) : ((CELLCOUNT % 3) + 3)) == 0)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1))) RESULT: Ultimate proved your program to be correct! [2025-02-08 08:49:49,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE