./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength.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 eb589a592aff310a2662d7a22b89559cebd75929901bc5e2cc7816fe45d47c92 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:37:40,112 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:37:40,166 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 13:37:40,171 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:37:40,172 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:37:40,190 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:37:40,191 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:37:40,191 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:37:40,191 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:37:40,192 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:37:40,192 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:37:40,192 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:37:40,193 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:37:40,193 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:37:40,193 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:37:40,193 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:37:40,194 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 13:37:40,194 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:37:40,194 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:37:40,194 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:37:40,194 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:37:40,194 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 13:37:40,194 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:37:40,194 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 13:37:40,194 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 13:37:40,194 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:37:40,194 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:37:40,194 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 13:37:40,194 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:37:40,195 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:37:40,195 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:37:40,195 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:37:40,195 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:37:40,195 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:37:40,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:37:40,195 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:37:40,195 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:37:40,195 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 13:37:40,196 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 13:37:40,196 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:37:40,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:37:40,196 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:37:40,196 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:37:40,196 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:37:40,196 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:37:40,196 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 -> eb589a592aff310a2662d7a22b89559cebd75929901bc5e2cc7816fe45d47c92 [2025-02-06 13:37:40,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:37:40,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:37:40,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:37:40,424 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:37:40,424 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:37:40,425 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength.c [2025-02-06 13:37:41,701 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ea014e3fb/f1b41dc5975742a184b562b42f1f9e77/FLAG46b2f5d97 [2025-02-06 13:37:41,875 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:37:41,876 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength.c [2025-02-06 13:37:41,889 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ea014e3fb/f1b41dc5975742a184b562b42f1f9e77/FLAG46b2f5d97 [2025-02-06 13:37:41,899 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ea014e3fb/f1b41dc5975742a184b562b42f1f9e77 [2025-02-06 13:37:41,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:37:41,902 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:37:41,906 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:37:41,906 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:37:41,910 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:37:41,910 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:37:41" (1/1) ... [2025-02-06 13:37:41,911 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71cb056c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:41, skipping insertion in model container [2025-02-06 13:37:41,911 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:37:41" (1/1) ... [2025-02-06 13:37:41,923 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:37:42,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:37:42,030 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:37:42,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:37:42,049 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:37:42,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:42 WrapperNode [2025-02-06 13:37:42,050 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:37:42,050 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:37:42,051 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:37:42,051 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:37:42,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:42" (1/1) ... [2025-02-06 13:37:42,061 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:42" (1/1) ... [2025-02-06 13:37:42,072 INFO L138 Inliner]: procedures = 8, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 56 [2025-02-06 13:37:42,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:37:42,073 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:37:42,073 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:37:42,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:37:42,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:42" (1/1) ... [2025-02-06 13:37:42,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:42" (1/1) ... [2025-02-06 13:37:42,081 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:42" (1/1) ... [2025-02-06 13:37:42,093 INFO L175 MemorySlicer]: Split 3 memory accesses to 1 slices as follows [3]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 1 writes are split as follows [1]. [2025-02-06 13:37:42,094 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:42" (1/1) ... [2025-02-06 13:37:42,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:42" (1/1) ... [2025-02-06 13:37:42,097 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:42" (1/1) ... [2025-02-06 13:37:42,102 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:42" (1/1) ... [2025-02-06 13:37:42,102 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:42" (1/1) ... [2025-02-06 13:37:42,103 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:42" (1/1) ... [2025-02-06 13:37:42,103 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:37:42,104 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:37:42,104 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:37:42,104 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:37:42,105 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:42" (1/1) ... [2025-02-06 13:37:42,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:37:42,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:37:42,132 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 13:37:42,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 13:37:42,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 13:37:42,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:37:42,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:37:42,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 13:37:42,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 13:37:42,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 13:37:42,200 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:37:42,201 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:37:42,304 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L21: call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset; [2025-02-06 13:37:42,309 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-02-06 13:37:42,309 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:37:42,315 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:37:42,315 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:37:42,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:37:42 BoogieIcfgContainer [2025-02-06 13:37:42,315 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:37:42,317 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:37:42,317 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:37:42,320 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:37:42,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:37:41" (1/3) ... [2025-02-06 13:37:42,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71fdd6e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:37:42, skipping insertion in model container [2025-02-06 13:37:42,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:42" (2/3) ... [2025-02-06 13:37:42,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71fdd6e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:37:42, skipping insertion in model container [2025-02-06 13:37:42,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:37:42" (3/3) ... [2025-02-06 13:37:42,323 INFO L128 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength.c [2025-02-06 13:37:42,334 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:37:42,336 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ArraysOfVariableLength.c that has 1 procedures, 23 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-02-06 13:37:42,377 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:37:42,388 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;@53bdf616, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:37:42,389 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 13:37:42,393 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 16 states have (on average 1.625) internal successors, (26), 22 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-06 13:37:42,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 13:37:42,397 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:42,397 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 13:37:42,398 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:37:42,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:42,402 INFO L85 PathProgramCache]: Analyzing trace with hash 57226491, now seen corresponding path program 1 times [2025-02-06 13:37:42,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:42,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607419278] [2025-02-06 13:37:42,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:42,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:42,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:37:42,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:37:42,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:42,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:42,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:37:42,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:42,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607419278] [2025-02-06 13:37:42,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607419278] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:37:42,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:37:42,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:37:42,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926446527] [2025-02-06 13:37:42,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:37:42,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:37:42,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:37:42,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:37:42,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:37:42,597 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.625) internal successors, (26), 22 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) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:42,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:37:42,650 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2025-02-06 13:37:42,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:37:42,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-06 13:37:42,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:37:42,658 INFO L225 Difference]: With dead ends: 49 [2025-02-06 13:37:42,659 INFO L226 Difference]: Without dead ends: 24 [2025-02-06 13:37:42,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:37:42,664 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:37:42,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 53 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:37:42,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-06 13:37:42,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2025-02-06 13:37:42,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:42,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2025-02-06 13:37:42,694 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 5 [2025-02-06 13:37:42,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:37:42,694 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2025-02-06 13:37:42,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:42,694 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2025-02-06 13:37:42,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 13:37:42,695 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:42,695 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 13:37:42,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:37:42,696 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:37:42,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:42,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1774016249, now seen corresponding path program 1 times [2025-02-06 13:37:42,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:42,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269374088] [2025-02-06 13:37:42,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:42,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:42,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 13:37:42,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 13:37:42,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:42,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:42,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:37:42,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:42,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269374088] [2025-02-06 13:37:42,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269374088] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:37:42,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:37:42,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:37:42,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390864057] [2025-02-06 13:37:42,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:37:42,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:37:42,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:37:42,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:37:42,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:37:42,765 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:42,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:37:42,799 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2025-02-06 13:37:42,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:37:42,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-06 13:37:42,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:37:42,800 INFO L225 Difference]: With dead ends: 28 [2025-02-06 13:37:42,800 INFO L226 Difference]: Without dead ends: 26 [2025-02-06 13:37:42,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:37:42,801 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:37:42,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 39 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:37:42,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-02-06 13:37:42,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2025-02-06 13:37:42,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 23 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-06 13:37:42,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2025-02-06 13:37:42,805 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 6 [2025-02-06 13:37:42,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:37:42,806 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2025-02-06 13:37:42,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:42,806 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2025-02-06 13:37:42,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 13:37:42,806 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:42,806 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:37:42,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:37:42,806 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:37:42,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:42,807 INFO L85 PathProgramCache]: Analyzing trace with hash 215010659, now seen corresponding path program 1 times [2025-02-06 13:37:42,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:42,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385080050] [2025-02-06 13:37:42,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:42,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:42,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:37:42,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:37:42,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:42,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:42,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:37:42,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:42,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385080050] [2025-02-06 13:37:42,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385080050] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:37:42,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:37:42,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:37:42,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983221697] [2025-02-06 13:37:42,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:37:42,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:37:42,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:37:42,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:37:42,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:37:42,870 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:42,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:37:42,892 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2025-02-06 13:37:42,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:37:42,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-06 13:37:42,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:37:42,894 INFO L225 Difference]: With dead ends: 29 [2025-02-06 13:37:42,894 INFO L226 Difference]: Without dead ends: 27 [2025-02-06 13:37:42,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:37:42,895 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:37:42,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 45 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:37:42,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-06 13:37:42,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-02-06 13:37:42,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:42,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2025-02-06 13:37:42,901 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2025-02-06 13:37:42,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:37:42,901 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2025-02-06 13:37:42,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:42,901 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2025-02-06 13:37:42,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 13:37:42,902 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:42,902 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 13:37:42,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 13:37:42,902 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:37:42,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:42,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1924609135, now seen corresponding path program 1 times [2025-02-06 13:37:42,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:42,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783089032] [2025-02-06 13:37:42,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:42,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:42,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 13:37:42,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 13:37:42,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:42,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:42,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:37:42,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:42,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783089032] [2025-02-06 13:37:42,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783089032] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:37:42,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792678714] [2025-02-06 13:37:42,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:42,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:37:42,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:37:42,990 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:37:42,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 13:37:43,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 13:37:43,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 13:37:43,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:43,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:43,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 13:37:43,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:37:43,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:37:43,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:37:43,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:37:43,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792678714] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:37:43,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:37:43,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2025-02-06 13:37:43,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889320622] [2025-02-06 13:37:43,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:37:43,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 13:37:43,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:37:43,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 13:37:43,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:37:43,188 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:43,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:37:43,267 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2025-02-06 13:37:43,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 13:37:43,267 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 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-06 13:37:43,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:37:43,271 INFO L225 Difference]: With dead ends: 48 [2025-02-06 13:37:43,271 INFO L226 Difference]: Without dead ends: 28 [2025-02-06 13:37:43,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-02-06 13:37:43,272 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:37:43,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 73 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:37:43,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-06 13:37:43,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-02-06 13:37:43,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 25 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-06 13:37:43,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2025-02-06 13:37:43,276 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 11 [2025-02-06 13:37:43,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:37:43,276 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-02-06 13:37:43,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:43,276 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2025-02-06 13:37:43,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 13:37:43,276 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:43,276 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:37:43,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 13:37:43,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:37:43,477 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:37:43,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:43,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1925004335, now seen corresponding path program 1 times [2025-02-06 13:37:43,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:43,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003519375] [2025-02-06 13:37:43,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:43,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:43,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 13:37:43,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 13:37:43,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:43,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:43,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:37:43,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:43,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003519375] [2025-02-06 13:37:43,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003519375] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:37:43,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920061360] [2025-02-06 13:37:43,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:43,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:37:43,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:37:43,522 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:37:43,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 13:37:43,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 13:37:43,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 13:37:43,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:43,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:43,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:37:43,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:37:43,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:37:43,577 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:37:43,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:37:43,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920061360] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:37:43,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:37:43,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 13:37:43,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548071726] [2025-02-06 13:37:43,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:37:43,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 13:37:43,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:37:43,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 13:37:43,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:37:43,609 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:43,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:37:43,643 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2025-02-06 13:37:43,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 13:37:43,643 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 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-06 13:37:43,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:37:43,644 INFO L225 Difference]: With dead ends: 48 [2025-02-06 13:37:43,644 INFO L226 Difference]: Without dead ends: 41 [2025-02-06 13:37:43,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 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-06 13:37:43,645 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:37:43,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 71 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:37:43,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-06 13:37:43,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2025-02-06 13:37:43,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:43,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2025-02-06 13:37:43,650 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 11 [2025-02-06 13:37:43,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:37:43,651 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2025-02-06 13:37:43,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:43,651 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2025-02-06 13:37:43,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 13:37:43,651 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:43,651 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:37:43,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 13:37:43,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:37:43,855 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:37:43,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:43,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1586297108, now seen corresponding path program 1 times [2025-02-06 13:37:43,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:43,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600619154] [2025-02-06 13:37:43,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:43,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:43,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 13:37:43,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 13:37:43,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:43,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:43,924 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:37:43,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:43,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600619154] [2025-02-06 13:37:43,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600619154] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:37:43,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478861006] [2025-02-06 13:37:43,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:43,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:37:43,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:37:43,926 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:37:43,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 13:37:43,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 13:37:43,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 13:37:43,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:43,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:43,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 13:37:43,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:37:44,041 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:37:44,041 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:37:44,105 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:37:44,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478861006] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:37:44,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:37:44,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 15 [2025-02-06 13:37:44,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291791483] [2025-02-06 13:37:44,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:37:44,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 13:37:44,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:37:44,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 13:37:44,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-02-06 13:37:44,106 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:44,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:37:44,222 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2025-02-06 13:37:44,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 13:37:44,222 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-02-06 13:37:44,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:37:44,223 INFO L225 Difference]: With dead ends: 62 [2025-02-06 13:37:44,223 INFO L226 Difference]: Without dead ends: 36 [2025-02-06 13:37:44,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2025-02-06 13:37:44,233 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 8 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:37:44,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 75 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:37:44,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-06 13:37:44,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2025-02-06 13:37:44,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.2) internal successors, (36), 33 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:44,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2025-02-06 13:37:44,236 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 13 [2025-02-06 13:37:44,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:37:44,237 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2025-02-06 13:37:44,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:44,237 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2025-02-06 13:37:44,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 13:37:44,237 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:44,237 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1] [2025-02-06 13:37:44,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 13:37:44,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:37:44,438 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:37:44,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:44,438 INFO L85 PathProgramCache]: Analyzing trace with hash 85389676, now seen corresponding path program 1 times [2025-02-06 13:37:44,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:44,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253237318] [2025-02-06 13:37:44,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:44,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:44,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 13:37:44,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 13:37:44,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:44,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:44,518 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 13:37:44,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:44,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253237318] [2025-02-06 13:37:44,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253237318] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:37:44,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341481652] [2025-02-06 13:37:44,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:44,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:37:44,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:37:44,521 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:37:44,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 13:37:44,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 13:37:44,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 13:37:44,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:44,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:44,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:37:44,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:37:44,598 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 13:37:44,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:37:44,628 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 13:37:44,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341481652] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:37:44,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:37:44,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-06 13:37:44,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578309166] [2025-02-06 13:37:44,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:37:44,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 13:37:44,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:37:44,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 13:37:44,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:37:44,631 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 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-06 13:37:44,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:37:44,659 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2025-02-06 13:37:44,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:37:44,659 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 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 22 [2025-02-06 13:37:44,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:37:44,660 INFO L225 Difference]: With dead ends: 44 [2025-02-06 13:37:44,660 INFO L226 Difference]: Without dead ends: 43 [2025-02-06 13:37:44,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 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-06 13:37:44,661 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:37:44,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:37:44,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-06 13:37:44,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-02-06 13:37:44,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:44,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2025-02-06 13:37:44,668 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 22 [2025-02-06 13:37:44,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:37:44,668 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2025-02-06 13:37:44,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 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-06 13:37:44,668 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2025-02-06 13:37:44,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 13:37:44,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:44,669 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1] [2025-02-06 13:37:44,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 13:37:44,869 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,SelfDestructingSolverStorable6 [2025-02-06 13:37:44,870 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:37:44,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:44,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1648041269, now seen corresponding path program 1 times [2025-02-06 13:37:44,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:44,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804180846] [2025-02-06 13:37:44,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:44,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:44,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 13:37:44,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 13:37:44,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:44,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:45,013 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:37:45,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:45,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804180846] [2025-02-06 13:37:45,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804180846] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:37:45,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150029307] [2025-02-06 13:37:45,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:45,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:37:45,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:37:45,017 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:37:45,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 13:37:45,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 13:37:45,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 13:37:45,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:45,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:45,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 13:37:45,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:37:45,182 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:37:45,182 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:37:45,277 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:37:45,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150029307] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:37:45,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:37:45,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 21 [2025-02-06 13:37:45,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320362379] [2025-02-06 13:37:45,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:37:45,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 13:37:45,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:37:45,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 13:37:45,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2025-02-06 13:37:45,279 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 21 states, 21 states have (on average 2.380952380952381) internal successors, (50), 21 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:45,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:37:45,530 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2025-02-06 13:37:45,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 13:37:45,531 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.380952380952381) internal successors, (50), 21 states have internal predecessors, (50), 0 states have call successors, (0), 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 23 [2025-02-06 13:37:45,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:37:45,532 INFO L225 Difference]: With dead ends: 91 [2025-02-06 13:37:45,532 INFO L226 Difference]: Without dead ends: 64 [2025-02-06 13:37:45,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=1005, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 13:37:45,533 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 24 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:37:45,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 80 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:37:45,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-06 13:37:45,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2025-02-06 13:37:45,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:45,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2025-02-06 13:37:45,539 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 23 [2025-02-06 13:37:45,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:37:45,539 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2025-02-06 13:37:45,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.380952380952381) internal successors, (50), 21 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:45,539 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2025-02-06 13:37:45,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 13:37:45,540 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:45,540 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-02-06 13:37:45,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 13:37:45,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:37:45,741 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:37:45,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:45,742 INFO L85 PathProgramCache]: Analyzing trace with hash 589729184, now seen corresponding path program 1 times [2025-02-06 13:37:45,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:45,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172631051] [2025-02-06 13:37:45,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:45,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:45,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 13:37:45,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 13:37:45,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:45,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:45,800 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-06 13:37:45,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:45,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172631051] [2025-02-06 13:37:45,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172631051] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:37:45,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:37:45,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:37:45,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106171347] [2025-02-06 13:37:45,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:37:45,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:37:45,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:37:45,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:37:45,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:37:45,802 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:45,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:37:45,822 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2025-02-06 13:37:45,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:37:45,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-02-06 13:37:45,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:37:45,822 INFO L225 Difference]: With dead ends: 67 [2025-02-06 13:37:45,822 INFO L226 Difference]: Without dead ends: 65 [2025-02-06 13:37:45,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:37:45,823 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 3 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:37:45,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 33 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:37:45,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-06 13:37:45,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-02-06 13:37:45,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 64 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:45,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2025-02-06 13:37:45,833 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 30 [2025-02-06 13:37:45,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:37:45,833 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2025-02-06 13:37:45,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:45,833 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2025-02-06 13:37:45,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 13:37:45,833 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:45,833 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 2, 2, 2, 2, 1, 1, 1] [2025-02-06 13:37:45,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 13:37:45,833 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:37:45,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:45,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1245504015, now seen corresponding path program 2 times [2025-02-06 13:37:45,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:45,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742978643] [2025-02-06 13:37:45,834 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:37:45,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:45,843 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-02-06 13:37:45,848 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 31 statements. [2025-02-06 13:37:45,849 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:37:45,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:45,870 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 25 proven. 8 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-06 13:37:45,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:45,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742978643] [2025-02-06 13:37:45,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742978643] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:37:45,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761159140] [2025-02-06 13:37:45,871 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:37:45,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:37:45,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:37:45,873 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:37:45,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 13:37:45,909 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-02-06 13:37:45,913 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 31 statements. [2025-02-06 13:37:45,913 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:37:45,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:45,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 13:37:45,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:37:45,932 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 25 proven. 8 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-06 13:37:45,932 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:37:45,957 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 25 proven. 8 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-06 13:37:45,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761159140] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:37:45,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:37:45,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-02-06 13:37:45,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874359280] [2025-02-06 13:37:45,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:37:45,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:37:45,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:37:45,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:37:45,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:37:45,960 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:45,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:37:45,974 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2025-02-06 13:37:45,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:37:45,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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-06 13:37:45,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:37:45,974 INFO L225 Difference]: With dead ends: 65 [2025-02-06 13:37:45,976 INFO L226 Difference]: Without dead ends: 64 [2025-02-06 13:37:45,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:37:45,977 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:37:45,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:37:45,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-06 13:37:45,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2025-02-06 13:37:45,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 47 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:45,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2025-02-06 13:37:45,982 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 31 [2025-02-06 13:37:45,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:37:45,982 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2025-02-06 13:37:45,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:45,982 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2025-02-06 13:37:45,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-06 13:37:45,983 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:45,983 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 13:37:45,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 13:37:46,183 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,SelfDestructingSolverStorable9 [2025-02-06 13:37:46,183 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:37:46,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:46,184 INFO L85 PathProgramCache]: Analyzing trace with hash -337990205, now seen corresponding path program 1 times [2025-02-06 13:37:46,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:46,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841347405] [2025-02-06 13:37:46,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:46,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:46,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 13:37:46,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 13:37:46,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:46,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:46,317 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 13:37:46,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:46,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841347405] [2025-02-06 13:37:46,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841347405] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:37:46,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288348549] [2025-02-06 13:37:46,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:46,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:37:46,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:37:46,320 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:37:46,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 13:37:46,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 13:37:46,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 13:37:46,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:46,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:46,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 13:37:46,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:37:46,427 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 13:37:46,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:37:46,511 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 13:37:46,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288348549] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:37:46,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:37:46,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2025-02-06 13:37:46,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898273286] [2025-02-06 13:37:46,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:37:46,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 13:37:46,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:37:46,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 13:37:46,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2025-02-06 13:37:46,512 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 19 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 19 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:46,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:37:46,587 INFO L93 Difference]: Finished difference Result 93 states and 105 transitions. [2025-02-06 13:37:46,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 13:37:46,587 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 19 states have internal predecessors, (63), 0 states have call successors, (0), 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 34 [2025-02-06 13:37:46,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:37:46,588 INFO L225 Difference]: With dead ends: 93 [2025-02-06 13:37:46,588 INFO L226 Difference]: Without dead ends: 82 [2025-02-06 13:37:46,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2025-02-06 13:37:46,588 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:37:46,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 83 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:37:46,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-06 13:37:46,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-02-06 13:37:46,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 79 states have (on average 1.1139240506329113) internal successors, (88), 81 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:46,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2025-02-06 13:37:46,596 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 34 [2025-02-06 13:37:46,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:37:46,596 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2025-02-06 13:37:46,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 19 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:46,596 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2025-02-06 13:37:46,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-06 13:37:46,598 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:46,599 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 7, 7, 7, 7, 6, 1, 1, 1] [2025-02-06 13:37:46,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 13:37:46,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:37:46,803 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:37:46,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:46,803 INFO L85 PathProgramCache]: Analyzing trace with hash 140393704, now seen corresponding path program 2 times [2025-02-06 13:37:46,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:46,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749118740] [2025-02-06 13:37:46,803 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:37:46,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:46,815 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 2 equivalence classes. [2025-02-06 13:37:46,817 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 70 statements. [2025-02-06 13:37:46,817 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:37:46,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:46,828 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-02-06 13:37:46,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:46,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749118740] [2025-02-06 13:37:46,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749118740] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:37:46,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:37:46,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:37:46,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163347324] [2025-02-06 13:37:46,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:37:46,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:37:46,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:37:46,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:37:46,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:37:46,830 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:46,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:37:46,846 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2025-02-06 13:37:46,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:37:46,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-02-06 13:37:46,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:37:46,848 INFO L225 Difference]: With dead ends: 82 [2025-02-06 13:37:46,848 INFO L226 Difference]: Without dead ends: 81 [2025-02-06 13:37:46,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:37:46,848 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:37:46,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 25 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:37:46,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-06 13:37:46,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-06 13:37:46,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 79 states have (on average 1.1012658227848102) internal successors, (87), 80 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:46,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2025-02-06 13:37:46,856 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 70 [2025-02-06 13:37:46,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:37:46,856 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2025-02-06 13:37:46,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:46,856 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2025-02-06 13:37:46,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-06 13:37:46,857 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:46,857 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 7, 7, 7, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 13:37:46,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 13:37:46,857 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:37:46,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:46,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1351558845, now seen corresponding path program 2 times [2025-02-06 13:37:46,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:46,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846982882] [2025-02-06 13:37:46,858 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:37:46,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:46,883 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 78 statements into 2 equivalence classes. [2025-02-06 13:37:46,896 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-02-06 13:37:46,897 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:37:46,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:47,000 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2025-02-06 13:37:47,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:47,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846982882] [2025-02-06 13:37:47,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846982882] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:37:47,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512363243] [2025-02-06 13:37:47,000 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:37:47,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:37:47,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:37:47,002 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:37:47,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 13:37:47,061 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 78 statements into 2 equivalence classes. [2025-02-06 13:37:47,099 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-02-06 13:37:47,099 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:37:47,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:47,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 13:37:47,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:37:47,233 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 223 proven. 35 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-02-06 13:37:47,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:37:47,369 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 223 proven. 35 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-02-06 13:37:47,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512363243] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:37:47,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:37:47,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 14, 14] total 22 [2025-02-06 13:37:47,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543395230] [2025-02-06 13:37:47,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:37:47,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 13:37:47,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:37:47,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 13:37:47,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2025-02-06 13:37:47,370 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 22 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 22 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:47,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:37:47,663 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2025-02-06 13:37:47,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 13:37:47,663 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 22 states have internal predecessors, (70), 0 states have call successors, (0), 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 78 [2025-02-06 13:37:47,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:37:47,664 INFO L225 Difference]: With dead ends: 141 [2025-02-06 13:37:47,664 INFO L226 Difference]: Without dead ends: 94 [2025-02-06 13:37:47,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 132 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=773, Unknown=0, NotChecked=0, Total=930 [2025-02-06 13:37:47,665 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 16 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 13:37:47,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 65 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 13:37:47,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-06 13:37:47,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2025-02-06 13:37:47,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.0769230769230769) internal successors, (98), 91 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:47,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2025-02-06 13:37:47,681 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 78 [2025-02-06 13:37:47,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:37:47,682 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2025-02-06 13:37:47,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 22 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:47,682 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2025-02-06 13:37:47,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-06 13:37:47,683 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:47,683 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 7, 7, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 13:37:47,690 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-06 13:37:47,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:37:47,887 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:37:47,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:47,887 INFO L85 PathProgramCache]: Analyzing trace with hash -711588705, now seen corresponding path program 1 times [2025-02-06 13:37:47,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:47,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31596144] [2025-02-06 13:37:47,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:47,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:47,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-06 13:37:47,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-06 13:37:47,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:47,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:47,980 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2025-02-06 13:37:47,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:47,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31596144] [2025-02-06 13:37:47,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31596144] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:37:47,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:37:47,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:37:47,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195382122] [2025-02-06 13:37:47,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:37:47,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:37:47,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:37:47,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:37:47,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:37:47,982 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:47,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:37:47,996 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2025-02-06 13:37:47,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:37:47,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 91 [2025-02-06 13:37:47,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:37:47,997 INFO L225 Difference]: With dead ends: 92 [2025-02-06 13:37:47,997 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 13:37:47,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:37:47,997 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 5 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:37:47,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 19 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:37:47,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 13:37:47,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 13:37:47,999 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-06 13:37:47,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 13:37:47,999 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 91 [2025-02-06 13:37:47,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:37:47,999 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 13:37:47,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:37:48,000 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 13:37:48,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 13:37:48,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-02-06 13:37:48,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-02-06 13:37:48,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-02-06 13:37:48,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-02-06 13:37:48,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-02-06 13:37:48,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-02-06 13:37:48,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 13:37:48,006 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:37:48,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 13:37:48,212 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 13:37:48,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:37:48 BoogieIcfgContainer [2025-02-06 13:37:48,225 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 13:37:48,226 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 13:37:48,226 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 13:37:48,226 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 13:37:48,227 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:37:42" (3/4) ... [2025-02-06 13:37:48,228 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 13:37:48,234 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-02-06 13:37:48,234 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 13:37:48,234 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-06 13:37:48,234 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 13:37:48,290 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 13:37:48,290 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 13:37:48,290 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 13:37:48,290 INFO L158 Benchmark]: Toolchain (without parser) took 6388.23ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 113.4MB in the beginning and 116.7MB in the end (delta: -3.3MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. [2025-02-06 13:37:48,291 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:37:48,291 INFO L158 Benchmark]: CACSL2BoogieTranslator took 144.21ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 103.1MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:37:48,291 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.22ms. Allocated memory is still 142.6MB. Free memory was 103.1MB in the beginning and 101.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:37:48,291 INFO L158 Benchmark]: Boogie Preprocessor took 30.51ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 100.8MB in the end (delta: 901.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:37:48,292 INFO L158 Benchmark]: IcfgBuilder took 211.57ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 88.6MB in the end (delta: 12.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 13:37:48,292 INFO L158 Benchmark]: TraceAbstraction took 5908.45ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 88.1MB in the beginning and 121.9MB in the end (delta: -33.8MB). Peak memory consumption was 69.8MB. Max. memory is 16.1GB. [2025-02-06 13:37:48,293 INFO L158 Benchmark]: Witness Printer took 63.96ms. Allocated memory is still 176.2MB. Free memory was 121.9MB in the beginning and 116.7MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:37:48,295 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.13ms. Allocated memory is still 201.3MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 144.21ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 103.1MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.22ms. Allocated memory is still 142.6MB. Free memory was 103.1MB in the beginning and 101.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.51ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 100.8MB in the end (delta: 901.5kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 211.57ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 88.6MB in the end (delta: 12.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5908.45ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 88.1MB in the beginning and 121.9MB in the end (delta: -33.8MB). Peak memory consumption was 69.8MB. Max. memory is 16.1GB. * Witness Printer took 63.96ms. Allocated memory is still 176.2MB. Free memory was 121.9MB in the beginning and 116.7MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: 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, 23 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 14, TraceHistogramMax: 15, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 107 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 107 mSDsluCounter, 777 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 602 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1221 IncrementalHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 175 mSDtfsCounter, 1221 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 528 GetRequests, 367 SyntacticMatches, 18 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=13, InterpolantAutomatonStates: 123, 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, 14 MinimizatonAttempts, 34 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 658 NumberOfCodeBlocks, 545 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 851 ConstructedInterpolants, 0 QuantifiedInterpolants, 1715 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1118 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 30 InterpolantComputations, 6 PerfectInterpolantSequences, 2216/2469 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 6 specifications checked. All of them hold - InvariantResult [Line: 22]: Location Invariant Derived location invariant: ((((2 < i) || (i == 0)) || (i == 1)) || (2 == i)) - InvariantResult [Line: 25]: Location Invariant Derived location invariant: ((i == 0) || (0 < i)) - InvariantResult [Line: 14]: Location Invariant Derived location invariant: (((((((((((size <= 99) && (3 <= size)) && (i <= 99)) && (i == 0)) && (3 <= i)) || (((i == 0) && (size == 0)) && (i == 0))) || (((2 == size) && (2 == i)) && (i == 0))) || (((i == 1) && (i == 1)) && (size == 1))) || (((i == 1) && (i == 0)) && (size == 1))) || (((2 == size) && (2 == i)) && (1 <= i))) || ((((size <= 99) && (i <= 99)) && (3 <= i)) && (1 <= i))) RESULT: Ultimate proved your program to be correct! [2025-02-06 13:37:48,307 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