./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/psyco/psyco_abp_1-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 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/psyco/psyco_abp_1-2.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 167b835a28653099821c6834c1cc6b8e30303efac27d569b21e43e89592d7586 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:36:44,361 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:36:44,421 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 01:36:44,429 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:36:44,429 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:36:44,448 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:36:44,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:36:44,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:36:44,449 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:36:44,449 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:36:44,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:36:44,449 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:36:44,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:36:44,449 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:36:44,449 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:36:44,450 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:36:44,450 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:36:44,450 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:36:44,450 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:36:44,450 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:36:44,450 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:36:44,450 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:36:44,450 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:36:44,450 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:36:44,450 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:36:44,450 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:36:44,451 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:36:44,451 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:36:44,451 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:36:44,451 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:36:44,451 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:36:44,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:36:44,451 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:36:44,451 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:36:44,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:36:44,451 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:36:44,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:36:44,452 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:36:44,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:36:44,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:36:44,452 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:36:44,452 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:36:44,452 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:36:44,452 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:36:44,452 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:36:44,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:36:44,452 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:36:44,452 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:36:44,452 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:36:44,453 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:36:44,453 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 -> 167b835a28653099821c6834c1cc6b8e30303efac27d569b21e43e89592d7586 [2025-01-10 01:36:44,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:36:44,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:36:44,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:36:44,721 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:36:44,721 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:36:44,722 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/psyco/psyco_abp_1-2.c [2025-01-10 01:36:45,863 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/09a97b9c6/b072ac35e5cd432d95d53dbdca942a83/FLAG80b5cfa0a [2025-01-10 01:36:46,151 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:36:46,151 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/psyco/psyco_abp_1-2.c [2025-01-10 01:36:46,160 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/09a97b9c6/b072ac35e5cd432d95d53dbdca942a83/FLAG80b5cfa0a [2025-01-10 01:36:46,172 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/09a97b9c6/b072ac35e5cd432d95d53dbdca942a83 [2025-01-10 01:36:46,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:36:46,176 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:36:46,177 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:36:46,178 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:36:46,181 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:36:46,182 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:36:46" (1/1) ... [2025-01-10 01:36:46,182 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38e4d841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:46, skipping insertion in model container [2025-01-10 01:36:46,183 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:36:46" (1/1) ... [2025-01-10 01:36:46,203 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:36:46,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:36:46,406 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:36:46,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:36:46,477 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:36:46,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:46 WrapperNode [2025-01-10 01:36:46,478 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:36:46,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:36:46,479 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:36:46,479 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:36:46,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:46" (1/1) ... [2025-01-10 01:36:46,492 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:46" (1/1) ... [2025-01-10 01:36:46,518 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 506 [2025-01-10 01:36:46,519 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:36:46,519 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:36:46,519 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:36:46,520 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:36:46,526 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:46" (1/1) ... [2025-01-10 01:36:46,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:46" (1/1) ... [2025-01-10 01:36:46,528 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:46" (1/1) ... [2025-01-10 01:36:46,542 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 01:36:46,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:46" (1/1) ... [2025-01-10 01:36:46,542 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:46" (1/1) ... [2025-01-10 01:36:46,550 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:46" (1/1) ... [2025-01-10 01:36:46,554 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:46" (1/1) ... [2025-01-10 01:36:46,561 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:46" (1/1) ... [2025-01-10 01:36:46,563 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:46" (1/1) ... [2025-01-10 01:36:46,571 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:46" (1/1) ... [2025-01-10 01:36:46,576 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:36:46,576 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:36:46,576 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:36:46,576 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:36:46,578 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:46" (1/1) ... [2025-01-10 01:36:46,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:36:46,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:36:46,605 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-01-10 01:36:46,608 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-01-10 01:36:46,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:36:46,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:36:46,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:36:46,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:36:46,690 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:36:46,691 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:36:47,313 INFO L? ?]: Removed 327 outVars from TransFormulas that were not future-live. [2025-01-10 01:36:47,314 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:36:47,326 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:36:47,328 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 01:36:47,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:36:47 BoogieIcfgContainer [2025-01-10 01:36:47,329 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:36:47,331 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:36:47,331 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:36:47,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:36:47,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:36:46" (1/3) ... [2025-01-10 01:36:47,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb196fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:36:47, skipping insertion in model container [2025-01-10 01:36:47,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:36:46" (2/3) ... [2025-01-10 01:36:47,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb196fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:36:47, skipping insertion in model container [2025-01-10 01:36:47,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:36:47" (3/3) ... [2025-01-10 01:36:47,338 INFO L128 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-2.c [2025-01-10 01:36:47,348 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:36:47,349 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG psyco_abp_1-2.c that has 1 procedures, 195 locations, 1 initial locations, 1 loop locations, and 42 error locations. [2025-01-10 01:36:47,393 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:36:47,401 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;@58d625cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:36:47,401 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2025-01-10 01:36:47,406 INFO L276 IsEmpty]: Start isEmpty. Operand has 195 states, 152 states have (on average 1.9473684210526316) internal successors, (296), 194 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:36:47,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 01:36:47,409 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:36:47,410 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:36:47,410 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:36:47,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:36:47,416 INFO L85 PathProgramCache]: Analyzing trace with hash -796079221, now seen corresponding path program 1 times [2025-01-10 01:36:47,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:36:47,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305956711] [2025-01-10 01:36:47,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:36:47,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:36:47,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:36:47,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:36:47,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:36:47,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:36:47,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:36:47,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:36:47,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305956711] [2025-01-10 01:36:47,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305956711] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:36:47,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:36:47,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:36:47,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738909706] [2025-01-10 01:36:47,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:36:47,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:36:47,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:36:47,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:36:47,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:36:47,549 INFO L87 Difference]: Start difference. First operand has 195 states, 152 states have (on average 1.9473684210526316) internal successors, (296), 194 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-01-10 01:36:47,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:36:47,597 INFO L93 Difference]: Finished difference Result 390 states and 594 transitions. [2025-01-10 01:36:47,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:36:47,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-01-10 01:36:47,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:36:47,603 INFO L225 Difference]: With dead ends: 390 [2025-01-10 01:36:47,603 INFO L226 Difference]: Without dead ends: 166 [2025-01-10 01:36:47,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:36:47,607 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 4 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:36:47,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 559 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:36:47,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-01-10 01:36:47,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2025-01-10 01:36:47,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 124 states have (on average 1.685483870967742) internal successors, (209), 165 states have internal predecessors, (209), 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-01-10 01:36:47,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 209 transitions. [2025-01-10 01:36:47,630 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 209 transitions. Word has length 10 [2025-01-10 01:36:47,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:36:47,630 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 209 transitions. [2025-01-10 01:36:47,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-01-10 01:36:47,631 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 209 transitions. [2025-01-10 01:36:47,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 01:36:47,631 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:36:47,631 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:36:47,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:36:47,632 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:36:47,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:36:47,632 INFO L85 PathProgramCache]: Analyzing trace with hash 410821570, now seen corresponding path program 1 times [2025-01-10 01:36:47,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:36:47,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66923053] [2025-01-10 01:36:47,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:36:47,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:36:47,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:36:47,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:36:47,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:36:47,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:36:47,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:36:47,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:36:47,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66923053] [2025-01-10 01:36:47,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66923053] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:36:47,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:36:47,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:36:47,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207024280] [2025-01-10 01:36:47,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:36:47,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:36:47,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:36:47,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:36:47,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:36:47,699 INFO L87 Difference]: Start difference. First operand 166 states and 209 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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-01-10 01:36:47,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:36:47,835 INFO L93 Difference]: Finished difference Result 321 states and 407 transitions. [2025-01-10 01:36:47,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:36:47,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2025-01-10 01:36:47,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:36:47,837 INFO L225 Difference]: With dead ends: 321 [2025-01-10 01:36:47,837 INFO L226 Difference]: Without dead ends: 261 [2025-01-10 01:36:47,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:36:47,838 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 151 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:36:47,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 326 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:36:47,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-01-10 01:36:47,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 252. [2025-01-10 01:36:47,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 210 states have (on average 1.6238095238095238) internal successors, (341), 251 states have internal predecessors, (341), 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-01-10 01:36:47,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 341 transitions. [2025-01-10 01:36:47,855 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 341 transitions. Word has length 15 [2025-01-10 01:36:47,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:36:47,856 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 341 transitions. [2025-01-10 01:36:47,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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-01-10 01:36:47,856 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 341 transitions. [2025-01-10 01:36:47,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-10 01:36:47,856 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:36:47,856 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:36:47,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:36:47,857 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:36:47,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:36:47,857 INFO L85 PathProgramCache]: Analyzing trace with hash -337460028, now seen corresponding path program 1 times [2025-01-10 01:36:47,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:36:47,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668135393] [2025-01-10 01:36:47,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:36:47,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:36:47,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:36:47,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:36:47,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:36:47,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:36:47,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:36:47,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:36:47,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668135393] [2025-01-10 01:36:47,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668135393] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:36:47,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:36:47,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:36:47,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924487763] [2025-01-10 01:36:47,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:36:47,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:36:47,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:36:47,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:36:47,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:36:47,922 INFO L87 Difference]: Start difference. First operand 252 states and 341 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:36:47,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:36:47,986 INFO L93 Difference]: Finished difference Result 355 states and 487 transitions. [2025-01-10 01:36:47,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:36:47,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2025-01-10 01:36:47,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:36:47,988 INFO L225 Difference]: With dead ends: 355 [2025-01-10 01:36:47,991 INFO L226 Difference]: Without dead ends: 347 [2025-01-10 01:36:47,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:36:47,991 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 123 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:36:47,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 381 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:36:47,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-01-10 01:36:48,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 342. [2025-01-10 01:36:48,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 300 states have (on average 1.5766666666666667) internal successors, (473), 341 states have internal predecessors, (473), 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-01-10 01:36:48,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 473 transitions. [2025-01-10 01:36:48,009 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 473 transitions. Word has length 17 [2025-01-10 01:36:48,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:36:48,010 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 473 transitions. [2025-01-10 01:36:48,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-01-10 01:36:48,010 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 473 transitions. [2025-01-10 01:36:48,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 01:36:48,011 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:36:48,011 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:36:48,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:36:48,011 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:36:48,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:36:48,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1432035553, now seen corresponding path program 1 times [2025-01-10 01:36:48,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:36:48,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927300870] [2025-01-10 01:36:48,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:36:48,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:36:48,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:36:48,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:36:48,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:36:48,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:36:48,129 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:36:48,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:36:48,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927300870] [2025-01-10 01:36:48,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927300870] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:36:48,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:36:48,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:36:48,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293689737] [2025-01-10 01:36:48,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:36:48,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:36:48,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:36:48,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:36:48,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:36:48,130 INFO L87 Difference]: Start difference. First operand 342 states and 473 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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-01-10 01:36:48,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:36:48,158 INFO L93 Difference]: Finished difference Result 696 states and 970 transitions. [2025-01-10 01:36:48,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:36:48,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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 25 [2025-01-10 01:36:48,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:36:48,166 INFO L225 Difference]: With dead ends: 696 [2025-01-10 01:36:48,166 INFO L226 Difference]: Without dead ends: 357 [2025-01-10 01:36:48,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:36:48,167 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 39 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:36:48,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 354 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:36:48,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-01-10 01:36:48,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2025-01-10 01:36:48,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 315 states have (on average 1.5492063492063493) internal successors, (488), 356 states have internal predecessors, (488), 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-01-10 01:36:48,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 488 transitions. [2025-01-10 01:36:48,176 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 488 transitions. Word has length 25 [2025-01-10 01:36:48,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:36:48,177 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 488 transitions. [2025-01-10 01:36:48,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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-01-10 01:36:48,177 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 488 transitions. [2025-01-10 01:36:48,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-10 01:36:48,178 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:36:48,178 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:36:48,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:36:48,178 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:36:48,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:36:48,179 INFO L85 PathProgramCache]: Analyzing trace with hash 679144064, now seen corresponding path program 1 times [2025-01-10 01:36:48,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:36:48,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215617375] [2025-01-10 01:36:48,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:36:48,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:36:48,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:36:48,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:36:48,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:36:48,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:36:48,245 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:36:48,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:36:48,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215617375] [2025-01-10 01:36:48,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215617375] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:36:48,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717162074] [2025-01-10 01:36:48,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:36:48,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:36:48,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:36:48,250 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-01-10 01:36:48,251 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-01-10 01:36:48,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:36:48,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:36:48,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:36:48,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:36:48,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:36:48,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:36:48,367 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:36:48,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:36:48,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717162074] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:36:48,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:36:48,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 01:36:48,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273968942] [2025-01-10 01:36:48,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:36:48,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:36:48,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:36:48,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:36:48,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:36:48,369 INFO L87 Difference]: Start difference. First operand 357 states and 488 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 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-01-10 01:36:48,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:36:48,453 INFO L93 Difference]: Finished difference Result 366 states and 494 transitions. [2025-01-10 01:36:48,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:36:48,454 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 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 28 [2025-01-10 01:36:48,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:36:48,455 INFO L225 Difference]: With dead ends: 366 [2025-01-10 01:36:48,455 INFO L226 Difference]: Without dead ends: 349 [2025-01-10 01:36:48,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-01-10 01:36:48,456 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 278 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:36:48,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 394 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:36:48,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-01-10 01:36:48,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 340. [2025-01-10 01:36:48,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 315 states have (on average 1.4952380952380953) internal successors, (471), 339 states have internal predecessors, (471), 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-01-10 01:36:48,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 471 transitions. [2025-01-10 01:36:48,463 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 471 transitions. Word has length 28 [2025-01-10 01:36:48,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:36:48,463 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 471 transitions. [2025-01-10 01:36:48,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 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-01-10 01:36:48,463 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 471 transitions. [2025-01-10 01:36:48,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-10 01:36:48,464 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:36:48,464 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:36:48,471 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-01-10 01:36:48,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:36:48,665 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:36:48,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:36:48,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1415546692, now seen corresponding path program 1 times [2025-01-10 01:36:48,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:36:48,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058073066] [2025-01-10 01:36:48,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:36:48,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:36:48,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:36:48,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:36:48,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:36:48,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:36:48,688 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:36:48,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:36:48,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058073066] [2025-01-10 01:36:48,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058073066] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:36:48,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:36:48,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:36:48,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238730229] [2025-01-10 01:36:48,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:36:48,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:36:48,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:36:48,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:36:48,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:36:48,699 INFO L87 Difference]: Start difference. First operand 340 states and 471 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-01-10 01:36:48,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:36:48,720 INFO L93 Difference]: Finished difference Result 514 states and 699 transitions. [2025-01-10 01:36:48,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:36:48,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2025-01-10 01:36:48,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:36:48,721 INFO L225 Difference]: With dead ends: 514 [2025-01-10 01:36:48,721 INFO L226 Difference]: Without dead ends: 177 [2025-01-10 01:36:48,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:36:48,722 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 33 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:36:48,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 327 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:36:48,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-01-10 01:36:48,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2025-01-10 01:36:48,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 152 states have (on average 1.493421052631579) internal successors, (227), 176 states have internal predecessors, (227), 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-01-10 01:36:48,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 227 transitions. [2025-01-10 01:36:48,725 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 227 transitions. Word has length 29 [2025-01-10 01:36:48,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:36:48,726 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 227 transitions. [2025-01-10 01:36:48,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-01-10 01:36:48,726 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 227 transitions. [2025-01-10 01:36:48,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-10 01:36:48,726 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:36:48,726 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:36:48,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:36:48,726 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:36:48,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:36:48,727 INFO L85 PathProgramCache]: Analyzing trace with hash -421371848, now seen corresponding path program 1 times [2025-01-10 01:36:48,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:36:48,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981045486] [2025-01-10 01:36:48,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:36:48,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:36:48,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:36:48,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:36:48,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:36:48,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:36:48,753 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 01:36:48,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:36:48,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981045486] [2025-01-10 01:36:48,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981045486] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:36:48,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:36:48,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:36:48,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85908523] [2025-01-10 01:36:48,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:36:48,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:36:48,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:36:48,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:36:48,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:36:48,755 INFO L87 Difference]: Start difference. First operand 177 states and 227 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-01-10 01:36:48,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:36:48,763 INFO L93 Difference]: Finished difference Result 352 states and 452 transitions. [2025-01-10 01:36:48,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:36:48,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-01-10 01:36:48,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:36:48,764 INFO L225 Difference]: With dead ends: 352 [2025-01-10 01:36:48,764 INFO L226 Difference]: Without dead ends: 177 [2025-01-10 01:36:48,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:36:48,765 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 0 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:36:48,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 372 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:36:48,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-01-10 01:36:48,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2025-01-10 01:36:48,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 152 states have (on average 1.486842105263158) internal successors, (226), 176 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:36:48,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 226 transitions. [2025-01-10 01:36:48,769 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 226 transitions. Word has length 29 [2025-01-10 01:36:48,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:36:48,769 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 226 transitions. [2025-01-10 01:36:48,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-01-10 01:36:48,769 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 226 transitions. [2025-01-10 01:36:48,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-10 01:36:48,770 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:36:48,770 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:36:48,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:36:48,770 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:36:48,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:36:48,770 INFO L85 PathProgramCache]: Analyzing trace with hash -421370182, now seen corresponding path program 1 times [2025-01-10 01:36:48,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:36:48,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726015076] [2025-01-10 01:36:48,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:36:48,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:36:48,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:36:48,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:36:48,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:36:48,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:36:48,815 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:36:48,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:36:48,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726015076] [2025-01-10 01:36:48,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726015076] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:36:48,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885309249] [2025-01-10 01:36:48,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:36:48,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:36:48,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:36:48,818 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-01-10 01:36:48,823 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-01-10 01:36:48,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:36:48,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:36:48,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:36:48,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:36:48,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:36:48,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:36:48,914 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:36:48,915 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:36:48,966 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:36:48,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885309249] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:36:48,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:36:48,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 01:36:48,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245470953] [2025-01-10 01:36:48,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:36:48,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:36:48,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:36:48,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:36:48,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:36:48,968 INFO L87 Difference]: Start difference. First operand 177 states and 226 transitions. Second operand has 7 states, 6 states have (on average 10.0) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:36:49,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:36:49,105 INFO L93 Difference]: Finished difference Result 313 states and 420 transitions. [2025-01-10 01:36:49,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:36:49,106 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.0) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-01-10 01:36:49,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:36:49,111 INFO L225 Difference]: With dead ends: 313 [2025-01-10 01:36:49,111 INFO L226 Difference]: Without dead ends: 244 [2025-01-10 01:36:49,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:36:49,111 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 347 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:36:49,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 566 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:36:49,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-01-10 01:36:49,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 230. [2025-01-10 01:36:49,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 220 states have (on average 1.4727272727272727) internal successors, (324), 229 states have internal predecessors, (324), 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-01-10 01:36:49,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 324 transitions. [2025-01-10 01:36:49,121 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 324 transitions. Word has length 29 [2025-01-10 01:36:49,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:36:49,121 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 324 transitions. [2025-01-10 01:36:49,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.0) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:36:49,121 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 324 transitions. [2025-01-10 01:36:49,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-10 01:36:49,122 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:36:49,122 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:36:49,130 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-01-10 01:36:49,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:36:49,322 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:36:49,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:36:49,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1209808836, now seen corresponding path program 1 times [2025-01-10 01:36:49,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:36:49,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266370495] [2025-01-10 01:36:49,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:36:49,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:36:49,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 01:36:49,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:36:49,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:36:49,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:36:49,395 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:36:49,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:36:49,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266370495] [2025-01-10 01:36:49,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266370495] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:36:49,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607168090] [2025-01-10 01:36:49,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:36:49,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:36:49,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:36:49,398 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-01-10 01:36:49,403 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-01-10 01:36:49,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 01:36:49,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:36:49,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:36:49,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:36:49,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:36:49,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:36:49,562 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:36:49,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:36:49,610 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:36:49,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607168090] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:36:49,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:36:49,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 01:36:49,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765162367] [2025-01-10 01:36:49,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:36:49,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:36:49,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:36:49,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:36:49,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:36:49,611 INFO L87 Difference]: Start difference. First operand 230 states and 324 transitions. Second operand has 7 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 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-01-10 01:36:49,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:36:49,707 INFO L93 Difference]: Finished difference Result 433 states and 618 transitions. [2025-01-10 01:36:49,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:36:49,708 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 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-01-10 01:36:49,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:36:49,709 INFO L225 Difference]: With dead ends: 433 [2025-01-10 01:36:49,709 INFO L226 Difference]: Without dead ends: 425 [2025-01-10 01:36:49,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:36:49,711 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 537 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:36:49,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 618 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:36:49,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-01-10 01:36:49,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 418. [2025-01-10 01:36:49,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 412 states have (on average 1.441747572815534) internal successors, (594), 417 states have internal predecessors, (594), 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-01-10 01:36:49,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 594 transitions. [2025-01-10 01:36:49,724 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 594 transitions. Word has length 31 [2025-01-10 01:36:49,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:36:49,724 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 594 transitions. [2025-01-10 01:36:49,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 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-01-10 01:36:49,725 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 594 transitions. [2025-01-10 01:36:49,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-10 01:36:49,726 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:36:49,726 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:36:49,734 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-01-10 01:36:49,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:36:49,927 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:36:49,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:36:49,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1150632072, now seen corresponding path program 1 times [2025-01-10 01:36:49,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:36:49,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404885173] [2025-01-10 01:36:49,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:36:49,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:36:49,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 01:36:49,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 01:36:49,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:36:49,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:36:50,010 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:36:50,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:36:50,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404885173] [2025-01-10 01:36:50,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404885173] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:36:50,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800961099] [2025-01-10 01:36:50,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:36:50,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:36:50,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:36:50,013 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-01-10 01:36:50,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 01:36:50,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 01:36:50,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 01:36:50,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:36:50,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:36:50,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:36:50,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:36:50,095 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:36:50,095 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:36:50,132 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:36:50,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800961099] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:36:50,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:36:50,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 01:36:50,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913617703] [2025-01-10 01:36:50,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:36:50,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:36:50,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:36:50,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:36:50,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:36:50,133 INFO L87 Difference]: Start difference. First operand 418 states and 594 transitions. Second operand has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 7 states have internal predecessors, (68), 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-01-10 01:36:50,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:36:50,174 INFO L93 Difference]: Finished difference Result 418 states and 594 transitions. [2025-01-10 01:36:50,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:36:50,175 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 7 states have internal predecessors, (68), 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 32 [2025-01-10 01:36:50,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:36:50,176 INFO L225 Difference]: With dead ends: 418 [2025-01-10 01:36:50,176 INFO L226 Difference]: Without dead ends: 414 [2025-01-10 01:36:50,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:36:50,177 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 276 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:36:50,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 252 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:36:50,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-01-10 01:36:50,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 222. [2025-01-10 01:36:50,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 220 states have (on average 1.4181818181818182) internal successors, (312), 221 states have internal predecessors, (312), 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-01-10 01:36:50,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 312 transitions. [2025-01-10 01:36:50,183 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 312 transitions. Word has length 32 [2025-01-10 01:36:50,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:36:50,183 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 312 transitions. [2025-01-10 01:36:50,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 7 states have internal predecessors, (68), 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-01-10 01:36:50,183 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 312 transitions. [2025-01-10 01:36:50,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-10 01:36:50,184 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:36:50,184 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:36:50,190 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-01-10 01:36:50,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-10 01:36:50,385 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:36:50,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:36:50,386 INFO L85 PathProgramCache]: Analyzing trace with hash 76909513, now seen corresponding path program 1 times [2025-01-10 01:36:50,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:36:50,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882763313] [2025-01-10 01:36:50,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:36:50,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:36:50,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-10 01:36:50,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-10 01:36:50,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:36:50,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:36:50,487 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-10 01:36:50,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:36:50,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882763313] [2025-01-10 01:36:50,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882763313] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:36:50,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:36:50,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:36:50,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726345039] [2025-01-10 01:36:50,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:36:50,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:36:50,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:36:50,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:36:50,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:36:50,488 INFO L87 Difference]: Start difference. First operand 222 states and 312 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-01-10 01:36:50,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:36:50,556 INFO L93 Difference]: Finished difference Result 457 states and 649 transitions. [2025-01-10 01:36:50,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:36:50,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 56 [2025-01-10 01:36:50,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:36:50,557 INFO L225 Difference]: With dead ends: 457 [2025-01-10 01:36:50,560 INFO L226 Difference]: Without dead ends: 238 [2025-01-10 01:36:50,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:36:50,562 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 30 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:36:50,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 234 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:36:50,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-01-10 01:36:50,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2025-01-10 01:36:50,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 236 states have (on average 1.3983050847457628) internal successors, (330), 237 states have internal predecessors, (330), 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-01-10 01:36:50,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 330 transitions. [2025-01-10 01:36:50,576 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 330 transitions. Word has length 56 [2025-01-10 01:36:50,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:36:50,576 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 330 transitions. [2025-01-10 01:36:50,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-01-10 01:36:50,576 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 330 transitions. [2025-01-10 01:36:50,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-10 01:36:50,577 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:36:50,577 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:36:50,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:36:50,577 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:36:50,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:36:50,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1255791684, now seen corresponding path program 1 times [2025-01-10 01:36:50,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:36:50,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302103869] [2025-01-10 01:36:50,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:36:50,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:36:50,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-10 01:36:50,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-10 01:36:50,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:36:50,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:36:50,688 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:36:50,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:36:50,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302103869] [2025-01-10 01:36:50,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302103869] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:36:50,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:36:50,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:36:50,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288850772] [2025-01-10 01:36:50,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:36:50,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:36:50,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:36:50,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:36:50,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:36:50,690 INFO L87 Difference]: Start difference. First operand 238 states and 330 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-01-10 01:36:50,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:36:50,715 INFO L93 Difference]: Finished difference Result 449 states and 621 transitions. [2025-01-10 01:36:50,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:36:50,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 64 [2025-01-10 01:36:50,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:36:50,717 INFO L225 Difference]: With dead ends: 449 [2025-01-10 01:36:50,717 INFO L226 Difference]: Without dead ends: 214 [2025-01-10 01:36:50,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:36:50,718 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 55 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:36:50,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 171 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:36:50,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-01-10 01:36:50,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2025-01-10 01:36:50,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 212 states have (on average 1.349056603773585) internal successors, (286), 213 states have internal predecessors, (286), 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-01-10 01:36:50,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 286 transitions. [2025-01-10 01:36:50,724 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 286 transitions. Word has length 64 [2025-01-10 01:36:50,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:36:50,724 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 286 transitions. [2025-01-10 01:36:50,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-01-10 01:36:50,725 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 286 transitions. [2025-01-10 01:36:50,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-10 01:36:50,725 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:36:50,725 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:36:50,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:36:50,726 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:36:50,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:36:50,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1797156159, now seen corresponding path program 1 times [2025-01-10 01:36:50,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:36:50,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772477789] [2025-01-10 01:36:50,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:36:50,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:36:50,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-10 01:36:50,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-10 01:36:50,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:36:50,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:36:50,829 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-10 01:36:50,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:36:50,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772477789] [2025-01-10 01:36:50,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772477789] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:36:50,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:36:50,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:36:50,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219836744] [2025-01-10 01:36:50,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:36:50,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:36:50,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:36:50,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:36:50,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:36:50,831 INFO L87 Difference]: Start difference. First operand 214 states and 286 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-01-10 01:36:50,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:36:50,839 INFO L93 Difference]: Finished difference Result 332 states and 443 transitions. [2025-01-10 01:36:50,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:36:50,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 74 [2025-01-10 01:36:50,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:36:50,840 INFO L225 Difference]: With dead ends: 332 [2025-01-10 01:36:50,840 INFO L226 Difference]: Without dead ends: 214 [2025-01-10 01:36:50,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:36:50,841 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:36:50,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 234 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:36:50,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-01-10 01:36:50,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2025-01-10 01:36:50,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 212 states have (on average 1.3396226415094339) internal successors, (284), 213 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:36:50,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 284 transitions. [2025-01-10 01:36:50,848 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 284 transitions. Word has length 74 [2025-01-10 01:36:50,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:36:50,848 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 284 transitions. [2025-01-10 01:36:50,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-01-10 01:36:50,848 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 284 transitions. [2025-01-10 01:36:50,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-10 01:36:50,849 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:36:50,849 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:36:50,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:36:50,849 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:36:50,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:36:50,850 INFO L85 PathProgramCache]: Analyzing trace with hash -221932933, now seen corresponding path program 1 times [2025-01-10 01:36:50,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:36:50,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687684752] [2025-01-10 01:36:50,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:36:50,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:36:50,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-10 01:36:50,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-10 01:36:50,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:36:50,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:36:51,017 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 34 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:36:51,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:36:51,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687684752] [2025-01-10 01:36:51,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687684752] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:36:51,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246547159] [2025-01-10 01:36:51,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:36:51,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:36:51,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:36:51,019 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-01-10 01:36:51,023 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-01-10 01:36:51,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-10 01:36:51,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-10 01:36:51,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:36:51,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:36:51,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:36:51,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:36:51,169 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 34 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:36:51,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:36:51,256 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 34 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:36:51,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246547159] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:36:51,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:36:51,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-01-10 01:36:51,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784958988] [2025-01-10 01:36:51,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:36:51,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:36:51,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:36:51,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:36:51,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:36:51,257 INFO L87 Difference]: Start difference. First operand 214 states and 284 transitions. Second operand has 9 states, 8 states have (on average 17.75) internal successors, (142), 9 states have internal predecessors, (142), 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-01-10 01:36:51,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:36:51,366 INFO L93 Difference]: Finished difference Result 592 states and 792 transitions. [2025-01-10 01:36:51,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:36:51,366 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 17.75) internal successors, (142), 9 states have internal predecessors, (142), 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 76 [2025-01-10 01:36:51,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:36:51,368 INFO L225 Difference]: With dead ends: 592 [2025-01-10 01:36:51,368 INFO L226 Difference]: Without dead ends: 590 [2025-01-10 01:36:51,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:36:51,369 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 645 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:36:51,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 797 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:36:51,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2025-01-10 01:36:51,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2025-01-10 01:36:51,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 588 states have (on average 1.3333333333333333) internal successors, (784), 589 states have internal predecessors, (784), 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-01-10 01:36:51,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 784 transitions. [2025-01-10 01:36:51,379 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 784 transitions. Word has length 76 [2025-01-10 01:36:51,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:36:51,380 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 784 transitions. [2025-01-10 01:36:51,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 17.75) internal successors, (142), 9 states have internal predecessors, (142), 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-01-10 01:36:51,380 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 784 transitions. [2025-01-10 01:36:51,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-10 01:36:51,381 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:36:51,382 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 9, 9, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:36:51,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 01:36:51,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-10 01:36:51,583 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:36:51,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:36:51,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1562687325, now seen corresponding path program 2 times [2025-01-10 01:36:51,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:36:51,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009372] [2025-01-10 01:36:51,583 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:36:51,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:36:51,608 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 196 statements into 2 equivalence classes. [2025-01-10 01:36:51,650 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 196 of 196 statements. [2025-01-10 01:36:51,651 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:36:51,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:36:52,130 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 26 proven. 432 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 01:36:52,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:36:52,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009372] [2025-01-10 01:36:52,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009372] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:36:52,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748226781] [2025-01-10 01:36:52,131 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:36:52,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:36:52,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:36:52,134 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-01-10 01:36:52,136 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-01-10 01:36:52,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 196 statements into 2 equivalence classes. [2025-01-10 01:36:52,272 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 196 of 196 statements. [2025-01-10 01:36:52,272 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:36:52,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:36:52,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:36:52,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:36:52,524 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 26 proven. 432 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 01:36:52,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:36:52,815 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 26 proven. 432 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 01:36:52,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748226781] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:36:52,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:36:52,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-01-10 01:36:52,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439183070] [2025-01-10 01:36:52,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:36:52,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:36:52,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:36:52,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:36:52,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:36:52,817 INFO L87 Difference]: Start difference. First operand 590 states and 784 transitions. Second operand has 17 states, 16 states have (on average 22.375) internal successors, (358), 17 states have internal predecessors, (358), 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-01-10 01:36:53,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:36:53,065 INFO L93 Difference]: Finished difference Result 1344 states and 1800 transitions. [2025-01-10 01:36:53,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 01:36:53,066 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 22.375) internal successors, (358), 17 states have internal predecessors, (358), 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 196 [2025-01-10 01:36:53,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:36:53,070 INFO L225 Difference]: With dead ends: 1344 [2025-01-10 01:36:53,070 INFO L226 Difference]: Without dead ends: 1342 [2025-01-10 01:36:53,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 388 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:36:53,071 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 2235 mSDsluCounter, 1470 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2235 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:36:53,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2235 Valid, 1577 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:36:53,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-01-10 01:36:53,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1342. [2025-01-10 01:36:53,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1342 states, 1340 states have (on average 1.3313432835820895) internal successors, (1784), 1341 states have internal predecessors, (1784), 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-01-10 01:36:53,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1784 transitions. [2025-01-10 01:36:53,092 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1784 transitions. Word has length 196 [2025-01-10 01:36:53,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:36:53,092 INFO L471 AbstractCegarLoop]: Abstraction has 1342 states and 1784 transitions. [2025-01-10 01:36:53,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 22.375) internal successors, (358), 17 states have internal predecessors, (358), 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-01-10 01:36:53,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1784 transitions. [2025-01-10 01:36:53,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-01-10 01:36:53,097 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:36:53,097 INFO L218 NwaCegarLoop]: trace histogram [30, 29, 21, 21, 14, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:36:53,103 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-01-10 01:36:53,297 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,SelfDestructingSolverStorable14 [2025-01-10 01:36:53,297 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:36:53,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:36:53,298 INFO L85 PathProgramCache]: Analyzing trace with hash 564700961, now seen corresponding path program 3 times [2025-01-10 01:36:53,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:36:53,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991803101] [2025-01-10 01:36:53,298 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:36:53,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:36:53,325 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 436 statements into 15 equivalence classes. [2025-01-10 01:36:53,351 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 52 of 436 statements. [2025-01-10 01:36:53,354 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-10 01:36:53,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:36:53,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2662 backedges. 350 proven. 2 refuted. 0 times theorem prover too weak. 2310 trivial. 0 not checked. [2025-01-10 01:36:53,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:36:53,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991803101] [2025-01-10 01:36:53,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991803101] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:36:53,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629850731] [2025-01-10 01:36:53,656 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:36:53,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:36:53,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:36:53,662 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-01-10 01:36:53,664 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-01-10 01:36:53,768 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 436 statements into 15 equivalence classes. [2025-01-10 01:36:53,790 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 52 of 436 statements. [2025-01-10 01:36:53,790 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-10 01:36:53,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:36:53,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:36:53,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:36:53,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2662 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2025-01-10 01:36:53,877 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:36:53,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629850731] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:36:53,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:36:53,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-01-10 01:36:53,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260172938] [2025-01-10 01:36:53,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:36:53,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:36:53,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:36:53,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:36:53,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:36:53,878 INFO L87 Difference]: Start difference. First operand 1342 states and 1784 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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-01-10 01:36:53,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:36:53,959 INFO L93 Difference]: Finished difference Result 1342 states and 1784 transitions. [2025-01-10 01:36:53,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:36:53,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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 436 [2025-01-10 01:36:53,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:36:53,963 INFO L225 Difference]: With dead ends: 1342 [2025-01-10 01:36:53,964 INFO L226 Difference]: Without dead ends: 1341 [2025-01-10 01:36:53,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:36:53,965 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 107 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:36:53,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 278 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:36:53,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2025-01-10 01:36:53,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1292. [2025-01-10 01:36:53,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 1291 states have (on average 1.3315259488768396) internal successors, (1719), 1291 states have internal predecessors, (1719), 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-01-10 01:36:53,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1719 transitions. [2025-01-10 01:36:53,990 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 1719 transitions. Word has length 436 [2025-01-10 01:36:53,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:36:53,991 INFO L471 AbstractCegarLoop]: Abstraction has 1292 states and 1719 transitions. [2025-01-10 01:36:53,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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-01-10 01:36:53,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1719 transitions. [2025-01-10 01:36:53,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2025-01-10 01:36:53,996 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:36:53,997 INFO L218 NwaCegarLoop]: trace histogram [31, 30, 22, 22, 14, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:36:54,004 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-01-10 01:36:54,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:36:54,198 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:36:54,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:36:54,199 INFO L85 PathProgramCache]: Analyzing trace with hash -293545315, now seen corresponding path program 1 times [2025-01-10 01:36:54,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:36:54,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585533956] [2025-01-10 01:36:54,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:36:54,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:36:54,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 450 statements into 1 equivalence classes. [2025-01-10 01:36:54,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 450 of 450 statements. [2025-01-10 01:36:54,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:36:54,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:36:54,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2858 backedges. 728 proven. 0 refuted. 0 times theorem prover too weak. 2130 trivial. 0 not checked. [2025-01-10 01:36:54,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:36:54,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585533956] [2025-01-10 01:36:54,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585533956] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:36:54,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:36:54,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:36:54,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225569574] [2025-01-10 01:36:54,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:36:54,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:36:54,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:36:54,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:36:54,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:36:54,465 INFO L87 Difference]: Start difference. First operand 1292 states and 1719 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:36:54,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:36:54,485 INFO L93 Difference]: Finished difference Result 1958 states and 2603 transitions. [2025-01-10 01:36:54,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:36:54,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 450 [2025-01-10 01:36:54,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:36:54,488 INFO L225 Difference]: With dead ends: 1958 [2025-01-10 01:36:54,488 INFO L226 Difference]: Without dead ends: 717 [2025-01-10 01:36:54,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:36:54,492 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 20 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:36:54,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 197 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:36:54,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2025-01-10 01:36:54,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2025-01-10 01:36:54,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 716 states have (on average 1.3156424581005586) internal successors, (942), 716 states have internal predecessors, (942), 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-01-10 01:36:54,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 942 transitions. [2025-01-10 01:36:54,503 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 942 transitions. Word has length 450 [2025-01-10 01:36:54,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:36:54,504 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 942 transitions. [2025-01-10 01:36:54,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:36:54,504 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 942 transitions. [2025-01-10 01:36:54,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-01-10 01:36:54,509 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:36:54,509 INFO L218 NwaCegarLoop]: trace histogram [32, 31, 23, 23, 15, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:36:54,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 01:36:54,509 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:36:54,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:36:54,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1689123295, now seen corresponding path program 2 times [2025-01-10 01:36:54,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:36:54,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836294008] [2025-01-10 01:36:54,510 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:36:54,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:36:54,547 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 466 statements into 2 equivalence classes. [2025-01-10 01:36:54,612 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 466 of 466 statements. [2025-01-10 01:36:54,612 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:36:54,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:36:55,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3076 backedges. 62 proven. 2953 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-10 01:36:55,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:36:55,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836294008] [2025-01-10 01:36:55,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836294008] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:36:55,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400069988] [2025-01-10 01:36:55,984 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:36:55,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:36:55,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:36:55,985 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-01-10 01:36:55,987 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-01-10 01:36:56,106 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 466 statements into 2 equivalence classes. [2025-01-10 01:36:56,247 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 466 of 466 statements. [2025-01-10 01:36:56,247 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:36:56,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:36:56,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 1673 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-10 01:36:56,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:36:56,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3076 backedges. 62 proven. 2953 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-10 01:36:56,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:36:57,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3076 backedges. 62 proven. 2953 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-10 01:36:57,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400069988] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:36:57,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:36:57,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-01-10 01:36:57,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235775550] [2025-01-10 01:36:57,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:36:57,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-10 01:36:57,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:36:57,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-10 01:36:57,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2025-01-10 01:36:57,429 INFO L87 Difference]: Start difference. First operand 717 states and 942 transitions. Second operand has 35 states, 34 states have (on average 24.764705882352942) internal successors, (842), 35 states have internal predecessors, (842), 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-01-10 01:36:57,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:36:57,862 INFO L93 Difference]: Finished difference Result 1546 states and 2040 transitions. [2025-01-10 01:36:57,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-01-10 01:36:57,862 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 24.764705882352942) internal successors, (842), 35 states have internal predecessors, (842), 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 466 [2025-01-10 01:36:57,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:36:57,867 INFO L225 Difference]: With dead ends: 1546 [2025-01-10 01:36:57,868 INFO L226 Difference]: Without dead ends: 1545 [2025-01-10 01:36:57,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 962 GetRequests, 928 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2025-01-10 01:36:57,869 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 2584 mSDsluCounter, 2447 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2584 SdHoareTripleChecker+Valid, 2553 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:36:57,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2584 Valid, 2553 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:36:57,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2025-01-10 01:36:57,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1545. [2025-01-10 01:36:57,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1544 states have (on average 1.3154145077720207) internal successors, (2031), 1544 states have internal predecessors, (2031), 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-01-10 01:36:57,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2031 transitions. [2025-01-10 01:36:57,892 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2031 transitions. Word has length 466 [2025-01-10 01:36:57,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:36:57,892 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 2031 transitions. [2025-01-10 01:36:57,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 24.764705882352942) internal successors, (842), 35 states have internal predecessors, (842), 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-01-10 01:36:57,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2031 transitions. [2025-01-10 01:36:57,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1007 [2025-01-10 01:36:57,911 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:36:57,911 INFO L218 NwaCegarLoop]: trace histogram [68, 67, 50, 50, 33, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:36:57,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 01:36:58,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 01:36:58,112 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:36:58,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:36:58,112 INFO L85 PathProgramCache]: Analyzing trace with hash -718850856, now seen corresponding path program 3 times [2025-01-10 01:36:58,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:36:58,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322455452] [2025-01-10 01:36:58,112 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:36:58,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:36:58,174 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1006 statements into 28 equivalence classes. [2025-01-10 01:37:00,360 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) and asserted 1006 of 1006 statements. [2025-01-10 01:37:00,360 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2025-01-10 01:37:00,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:37:06,017 INFO L134 CoverageAnalysis]: Checked inductivity of 14929 backedges. 134 proven. 14662 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-01-10 01:37:06,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:37:06,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322455452] [2025-01-10 01:37:06,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322455452] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:37:06,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896244143] [2025-01-10 01:37:06,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:37:06,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:37:06,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:37:06,019 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:37:06,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 01:37:06,245 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1006 statements into 28 equivalence classes. [2025-01-10 01:37:06,915 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) and asserted 1006 of 1006 statements. [2025-01-10 01:37:06,915 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2025-01-10 01:37:06,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:37:06,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 3554 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-01-10 01:37:06,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:37:07,837 INFO L134 CoverageAnalysis]: Checked inductivity of 14929 backedges. 134 proven. 14662 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-01-10 01:37:07,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:37:09,786 INFO L134 CoverageAnalysis]: Checked inductivity of 14929 backedges. 134 proven. 14662 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-01-10 01:37:09,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896244143] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:37:09,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:37:09,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 70 [2025-01-10 01:37:09,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514546313] [2025-01-10 01:37:09,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:37:09,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2025-01-10 01:37:09,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:37:09,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2025-01-10 01:37:09,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2025-01-10 01:37:09,797 INFO L87 Difference]: Start difference. First operand 1545 states and 2031 transitions. Second operand has 71 states, 70 states have (on average 25.914285714285715) internal successors, (1814), 71 states have internal predecessors, (1814), 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-01-10 01:37:12,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:37:12,197 INFO L93 Difference]: Finished difference Result 3202 states and 4227 transitions. [2025-01-10 01:37:12,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-01-10 01:37:12,198 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 70 states have (on average 25.914285714285715) internal successors, (1814), 71 states have internal predecessors, (1814), 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 1006 [2025-01-10 01:37:12,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:37:12,223 INFO L225 Difference]: With dead ends: 3202 [2025-01-10 01:37:12,226 INFO L226 Difference]: Without dead ends: 3201 [2025-01-10 01:37:12,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2078 GetRequests, 2008 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2025-01-10 01:37:12,229 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 10654 mSDsluCounter, 5235 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10654 SdHoareTripleChecker+Valid, 5341 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 01:37:12,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10654 Valid, 5341 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 01:37:12,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3201 states. [2025-01-10 01:37:12,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3201 to 3201. [2025-01-10 01:37:12,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3201 states, 3200 states have (on average 1.3153125) internal successors, (4209), 3200 states have internal predecessors, (4209), 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-01-10 01:37:12,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3201 states to 3201 states and 4209 transitions. [2025-01-10 01:37:12,296 INFO L78 Accepts]: Start accepts. Automaton has 3201 states and 4209 transitions. Word has length 1006 [2025-01-10 01:37:12,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:37:12,297 INFO L471 AbstractCegarLoop]: Abstraction has 3201 states and 4209 transitions. [2025-01-10 01:37:12,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 70 states have (on average 25.914285714285715) internal successors, (1814), 71 states have internal predecessors, (1814), 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-01-10 01:37:12,298 INFO L276 IsEmpty]: Start isEmpty. Operand 3201 states and 4209 transitions. [2025-01-10 01:37:12,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2087 [2025-01-10 01:37:12,317 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:37:12,318 INFO L218 NwaCegarLoop]: trace histogram [140, 139, 104, 104, 69, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:37:12,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 01:37:12,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:37:12,523 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:37:12,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:37:12,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1013715894, now seen corresponding path program 4 times [2025-01-10 01:37:12,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:37:12,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544254327] [2025-01-10 01:37:12,525 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:37:12,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:37:12,652 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2086 statements into 2 equivalence classes. [2025-01-10 01:37:14,059 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2086 of 2086 statements. [2025-01-10 01:37:14,059 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:37:14,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:37:57,002 INFO L134 CoverageAnalysis]: Checked inductivity of 65365 backedges. 278 proven. 64810 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2025-01-10 01:37:57,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:37:57,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544254327] [2025-01-10 01:37:57,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544254327] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:37:57,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595840348] [2025-01-10 01:37:57,003 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:37:57,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:37:57,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:37:57,005 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:37:57,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 01:37:57,376 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2086 statements into 2 equivalence classes. [2025-01-10 01:37:58,181 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2086 of 2086 statements. [2025-01-10 01:37:58,181 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:37:58,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:37:58,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 7316 conjuncts, 140 conjuncts are in the unsatisfiable core [2025-01-10 01:37:58,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:37:59,987 INFO L134 CoverageAnalysis]: Checked inductivity of 65365 backedges. 278 proven. 64810 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2025-01-10 01:37:59,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:38:06,301 INFO L134 CoverageAnalysis]: Checked inductivity of 65365 backedges. 278 proven. 64810 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2025-01-10 01:38:06,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595840348] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:38:06,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:38:06,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2025-01-10 01:38:06,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825541830] [2025-01-10 01:38:06,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:38:06,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 142 states [2025-01-10 01:38:06,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:38:06,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2025-01-10 01:38:06,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2025-01-10 01:38:06,316 INFO L87 Difference]: Start difference. First operand 3201 states and 4209 transitions. Second operand has 142 states, 141 states have (on average 26.588652482269502) internal successors, (3749), 142 states have internal predecessors, (3749), 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)