./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps2-ll_valuebound5.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/nla-digbench-scaling/ps2-ll_valuebound5.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 1b50d522769b95768e9038f61a48a3b927d40a7b91b44cb14af45fcd08759b69 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:21:56,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:21:56,184 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 02:21:56,189 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:21:56,192 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:21:56,213 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:21:56,214 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:21:56,214 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:21:56,214 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:21:56,214 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:21:56,214 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:21:56,214 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:21:56,216 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:21:56,216 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:21:56,216 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:21:56,216 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:21:56,216 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:21:56,217 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:21:56,217 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:21:56,217 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:21:56,217 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:21:56,217 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:21:56,217 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:21:56,217 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:21:56,217 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:21:56,217 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:21:56,217 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:21:56,217 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:21:56,218 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:21:56,218 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:21:56,218 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:21:56,218 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:21:56,218 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:21:56,218 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:21:56,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:21:56,218 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:21:56,218 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:21:56,218 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:21:56,219 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:21:56,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:21:56,219 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:21:56,219 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:21:56,219 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:21:56,219 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:21:56,219 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:21:56,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:21:56,219 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:21:56,219 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:21:56,219 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:21:56,220 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:21:56,220 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 -> 1b50d522769b95768e9038f61a48a3b927d40a7b91b44cb14af45fcd08759b69 [2025-01-10 02:21:56,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:21:56,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:21:56,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:21:56,434 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:21:56,434 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:21:56,434 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps2-ll_valuebound5.c [2025-01-10 02:21:57,565 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c984dd1a/7d5429d4637b4280886ef6f56053bc8d/FLAG79ea95560 [2025-01-10 02:21:57,777 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:21:57,778 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps2-ll_valuebound5.c [2025-01-10 02:21:57,785 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c984dd1a/7d5429d4637b4280886ef6f56053bc8d/FLAG79ea95560 [2025-01-10 02:21:58,133 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c984dd1a/7d5429d4637b4280886ef6f56053bc8d [2025-01-10 02:21:58,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:21:58,137 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:21:58,138 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:21:58,138 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:21:58,141 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:21:58,141 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:21:58" (1/1) ... [2025-01-10 02:21:58,142 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e6d3f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:21:58, skipping insertion in model container [2025-01-10 02:21:58,142 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:21:58" (1/1) ... [2025-01-10 02:21:58,151 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:21:58,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:21:58,275 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:21:58,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:21:58,295 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:21:58,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:21:58 WrapperNode [2025-01-10 02:21:58,298 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:21:58,299 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:21:58,299 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:21:58,299 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:21:58,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:21:58" (1/1) ... [2025-01-10 02:21:58,308 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:21:58" (1/1) ... [2025-01-10 02:21:58,320 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2025-01-10 02:21:58,321 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:21:58,322 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:21:58,323 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:21:58,323 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:21:58,329 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:21:58" (1/1) ... [2025-01-10 02:21:58,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:21:58" (1/1) ... [2025-01-10 02:21:58,330 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:21:58" (1/1) ... [2025-01-10 02:21:58,340 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 02:21:58,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:21:58" (1/1) ... [2025-01-10 02:21:58,343 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:21:58" (1/1) ... [2025-01-10 02:21:58,344 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:21:58" (1/1) ... [2025-01-10 02:21:58,346 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:21:58" (1/1) ... [2025-01-10 02:21:58,348 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:21:58" (1/1) ... [2025-01-10 02:21:58,350 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:21:58" (1/1) ... [2025-01-10 02:21:58,355 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:21:58" (1/1) ... [2025-01-10 02:21:58,356 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:21:58,356 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:21:58,356 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:21:58,356 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:21:58,357 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:21:58" (1/1) ... [2025-01-10 02:21:58,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:21:58,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:21:58,382 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 02:21:58,384 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 02:21:58,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:21:58,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:21:58,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:21:58,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:21:58,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 02:21:58,402 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 02:21:58,439 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:21:58,441 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:21:58,597 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2025-01-10 02:21:58,597 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:21:58,603 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:21:58,603 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 02:21:58,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:21:58 BoogieIcfgContainer [2025-01-10 02:21:58,604 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:21:58,605 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:21:58,605 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:21:58,608 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:21:58,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:21:58" (1/3) ... [2025-01-10 02:21:58,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@753f8e3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:21:58, skipping insertion in model container [2025-01-10 02:21:58,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:21:58" (2/3) ... [2025-01-10 02:21:58,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@753f8e3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:21:58, skipping insertion in model container [2025-01-10 02:21:58,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:21:58" (3/3) ... [2025-01-10 02:21:58,613 INFO L128 eAbstractionObserver]: Analyzing ICFG ps2-ll_valuebound5.c [2025-01-10 02:21:58,624 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:21:58,625 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ps2-ll_valuebound5.c that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 22 error locations. [2025-01-10 02:21:58,668 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:21:58,677 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;@6a7b78ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:21:58,677 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-01-10 02:21:58,680 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 57 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:21:58,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 02:21:58,683 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:21:58,683 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 02:21:58,684 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 02:21:58,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:21:58,688 INFO L85 PathProgramCache]: Analyzing trace with hash 28693830, now seen corresponding path program 1 times [2025-01-10 02:21:58,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:21:58,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782880885] [2025-01-10 02:21:58,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:21:58,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:21:58,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 02:21:58,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 02:21:58,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:21:58,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:21:58,782 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 02:21:58,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:21:58,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782880885] [2025-01-10 02:21:58,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782880885] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:21:58,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:21:58,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:21:58,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315917703] [2025-01-10 02:21:58,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:21:58,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 02:21:58,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:21:58,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 02:21:58,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 02:21:58,803 INFO L87 Difference]: Start difference. First operand has 61 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 57 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:21:58,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:21:58,819 INFO L93 Difference]: Finished difference Result 116 states and 127 transitions. [2025-01-10 02:21:58,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 02:21:58,821 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-10 02:21:58,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:21:58,825 INFO L225 Difference]: With dead ends: 116 [2025-01-10 02:21:58,825 INFO L226 Difference]: Without dead ends: 52 [2025-01-10 02:21:58,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 02:21:58,830 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:21:58,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:21:58,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-10 02:21:58,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-01-10 02:21:58,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 49 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:21:58,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2025-01-10 02:21:58,861 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 5 [2025-01-10 02:21:58,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:21:58,861 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2025-01-10 02:21:58,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:21:58,861 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2025-01-10 02:21:58,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 02:21:58,862 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:21:58,862 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 02:21:58,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 02:21:58,863 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 02:21:58,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:21:58,863 INFO L85 PathProgramCache]: Analyzing trace with hash 889568358, now seen corresponding path program 1 times [2025-01-10 02:21:58,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:21:58,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967397264] [2025-01-10 02:21:58,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:21:58,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:21:58,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 02:21:58,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 02:21:58,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:21:58,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:21:58,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [595737242] [2025-01-10 02:21:58,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:21:58,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:21:58,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:21:58,881 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 02:21:58,884 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 02:21:58,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 02:21:58,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 02:21:58,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:21:58,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:21:58,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:21:58,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:21:58,938 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 02:21:58,938 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:21:58,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:21:58,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967397264] [2025-01-10 02:21:58,939 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:21:58,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595737242] [2025-01-10 02:21:58,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595737242] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:21:58,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:21:58,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:21:58,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458884371] [2025-01-10 02:21:58,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:21:58,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:21:58,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:21:58,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:21:58,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:21:58,941 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:21:59,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:21:59,019 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2025-01-10 02:21:59,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:21:59,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-10 02:21:59,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:21:59,020 INFO L225 Difference]: With dead ends: 84 [2025-01-10 02:21:59,020 INFO L226 Difference]: Without dead ends: 80 [2025-01-10 02:21:59,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 02:21:59,021 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 25 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:21:59,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 52 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:21:59,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-01-10 02:21:59,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2025-01-10 02:21:59,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 64 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:21:59,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2025-01-10 02:21:59,030 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 6 [2025-01-10 02:21:59,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:21:59,030 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2025-01-10 02:21:59,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:21:59,030 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2025-01-10 02:21:59,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 02:21:59,031 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:21:59,031 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:21:59,037 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 02:21:59,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:21:59,231 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 02:21:59,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:21:59,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815370, now seen corresponding path program 1 times [2025-01-10 02:21:59,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:21:59,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145936653] [2025-01-10 02:21:59,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:21:59,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:21:59,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 02:21:59,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 02:21:59,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:21:59,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:21:59,274 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 02:21:59,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:21:59,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145936653] [2025-01-10 02:21:59,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145936653] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:21:59,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:21:59,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:21:59,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768090721] [2025-01-10 02:21:59,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:21:59,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:21:59,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:21:59,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:21:59,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:21:59,276 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:21:59,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:21:59,335 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2025-01-10 02:21:59,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:21:59,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-10 02:21:59,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:21:59,336 INFO L225 Difference]: With dead ends: 86 [2025-01-10 02:21:59,336 INFO L226 Difference]: Without dead ends: 78 [2025-01-10 02:21:59,336 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 02:21:59,337 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 22 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:21:59,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 56 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:21:59,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-10 02:21:59,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2025-01-10 02:21:59,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.52) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:21:59,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2025-01-10 02:21:59,347 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 7 [2025-01-10 02:21:59,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:21:59,347 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2025-01-10 02:21:59,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:21:59,348 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2025-01-10 02:21:59,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 02:21:59,348 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:21:59,348 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:21:59,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 02:21:59,348 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 02:21:59,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:21:59,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1988383382, now seen corresponding path program 1 times [2025-01-10 02:21:59,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:21:59,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712066841] [2025-01-10 02:21:59,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:21:59,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:21:59,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 02:21:59,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 02:21:59,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:21:59,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:21:59,452 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 02:21:59,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:21:59,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712066841] [2025-01-10 02:21:59,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712066841] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:21:59,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:21:59,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:21:59,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844210546] [2025-01-10 02:21:59,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:21:59,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:21:59,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:21:59,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:21:59,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:21:59,455 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:21:59,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:21:59,535 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2025-01-10 02:21:59,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:21:59,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-10 02:21:59,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:21:59,536 INFO L225 Difference]: With dead ends: 82 [2025-01-10 02:21:59,536 INFO L226 Difference]: Without dead ends: 70 [2025-01-10 02:21:59,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:21:59,537 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 37 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:21:59,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 54 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:21:59,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-10 02:21:59,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2025-01-10 02:21:59,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 62 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:21:59,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2025-01-10 02:21:59,542 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 10 [2025-01-10 02:21:59,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:21:59,542 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2025-01-10 02:21:59,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:21:59,542 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2025-01-10 02:21:59,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-10 02:21:59,543 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:21:59,543 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:21:59,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 02:21:59,543 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 02:21:59,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:21:59,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1124560398, now seen corresponding path program 1 times [2025-01-10 02:21:59,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:21:59,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801098070] [2025-01-10 02:21:59,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:21:59,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:21:59,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 02:21:59,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 02:21:59,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:21:59,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:21:59,614 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 02:21:59,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:21:59,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801098070] [2025-01-10 02:21:59,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801098070] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:21:59,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:21:59,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:21:59,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51880299] [2025-01-10 02:21:59,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:21:59,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:21:59,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:21:59,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:21:59,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:21:59,615 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:21:59,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:21:59,636 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2025-01-10 02:21:59,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:21:59,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-01-10 02:21:59,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:21:59,637 INFO L225 Difference]: With dead ends: 68 [2025-01-10 02:21:59,637 INFO L226 Difference]: Without dead ends: 66 [2025-01-10 02:21:59,637 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 02:21:59,638 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:21:59,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 93 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:21:59,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-01-10 02:21:59,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-01-10 02:21:59,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 62 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:21:59,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2025-01-10 02:21:59,643 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 19 [2025-01-10 02:21:59,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:21:59,644 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2025-01-10 02:21:59,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:21:59,644 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2025-01-10 02:21:59,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 02:21:59,647 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:21:59,648 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:21:59,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 02:21:59,648 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 02:21:59,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:21:59,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1984282122, now seen corresponding path program 1 times [2025-01-10 02:21:59,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:21:59,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770373081] [2025-01-10 02:21:59,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:21:59,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:21:59,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 02:21:59,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 02:21:59,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:21:59,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:21:59,744 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 02:21:59,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:21:59,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770373081] [2025-01-10 02:21:59,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770373081] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:21:59,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:21:59,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:21:59,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500414556] [2025-01-10 02:21:59,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:21:59,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:21:59,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:21:59,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:21:59,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:21:59,745 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:21:59,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:21:59,821 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2025-01-10 02:21:59,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:21:59,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-01-10 02:21:59,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:21:59,822 INFO L225 Difference]: With dead ends: 69 [2025-01-10 02:21:59,822 INFO L226 Difference]: Without dead ends: 68 [2025-01-10 02:21:59,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:21:59,824 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:21:59,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 64 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:21:59,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-01-10 02:21:59,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2025-01-10 02:21:59,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 63 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:21:59,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2025-01-10 02:21:59,831 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 23 [2025-01-10 02:21:59,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:21:59,831 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2025-01-10 02:21:59,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:21:59,833 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2025-01-10 02:21:59,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-10 02:21:59,833 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:21:59,833 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:21:59,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 02:21:59,833 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 02:21:59,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:21:59,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1383203562, now seen corresponding path program 1 times [2025-01-10 02:21:59,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:21:59,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338269721] [2025-01-10 02:21:59,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:21:59,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:21:59,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 02:21:59,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 02:21:59,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:21:59,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:21:59,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:21:59,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:21:59,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338269721] [2025-01-10 02:21:59,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338269721] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:21:59,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:21:59,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:21:59,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775260678] [2025-01-10 02:21:59,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:21:59,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:21:59,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:21:59,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:21:59,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:21:59,908 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:21:59,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:21:59,985 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2025-01-10 02:21:59,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:21:59,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-01-10 02:21:59,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:21:59,986 INFO L225 Difference]: With dead ends: 69 [2025-01-10 02:21:59,986 INFO L226 Difference]: Without dead ends: 68 [2025-01-10 02:21:59,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:21:59,987 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:21:59,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:21:59,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-01-10 02:21:59,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-01-10 02:21:59,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 64 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:21:59,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2025-01-10 02:21:59,994 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 24 [2025-01-10 02:21:59,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:21:59,994 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2025-01-10 02:21:59,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:21:59,995 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2025-01-10 02:21:59,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-10 02:21:59,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:21:59,995 INFO L218 NwaCegarLoop]: trace histogram [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 02:21:59,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 02:21:59,995 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 02:21:59,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:21:59,995 INFO L85 PathProgramCache]: Analyzing trace with hash -2113727208, now seen corresponding path program 1 times [2025-01-10 02:21:59,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:21:59,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076106872] [2025-01-10 02:21:59,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:21:59,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:22:00,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 02:22:00,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 02:22:00,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:22:00,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:22:00,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1920536627] [2025-01-10 02:22:00,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:22:00,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:22:00,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:22:00,016 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 02:22:00,017 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 02:22:00,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 02:22:00,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 02:22:00,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:22:00,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:22:00,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:22:00,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:22:00,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:22:00,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:22:00,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:22:00,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:22:00,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076106872] [2025-01-10 02:22:00,159 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:22:00,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920536627] [2025-01-10 02:22:00,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920536627] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:22:00,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:22:00,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-01-10 02:22:00,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971940058] [2025-01-10 02:22:00,160 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:22:00,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:22:00,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:22:00,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:22:00,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:22:00,161 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:22:00,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:22:00,280 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2025-01-10 02:22:00,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:22:00,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-01-10 02:22:00,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:22:00,281 INFO L225 Difference]: With dead ends: 131 [2025-01-10 02:22:00,281 INFO L226 Difference]: Without dead ends: 127 [2025-01-10 02:22:00,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:22:00,282 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 91 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:22:00,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 101 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:22:00,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-01-10 02:22:00,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 99. [2025-01-10 02:22:00,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.5064935064935066) internal successors, (116), 93 states have internal predecessors, (116), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:22:00,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 124 transitions. [2025-01-10 02:22:00,287 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 124 transitions. Word has length 26 [2025-01-10 02:22:00,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:22:00,287 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 124 transitions. [2025-01-10 02:22:00,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:22:00,288 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 124 transitions. [2025-01-10 02:22:00,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-10 02:22:00,288 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:22:00,288 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:22:00,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 02:22:00,491 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 02:22:00,491 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 02:22:00,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:22:00,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1101033960, now seen corresponding path program 1 times [2025-01-10 02:22:00,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:22:00,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099688237] [2025-01-10 02:22:00,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:22:00,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:22:00,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 02:22:00,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 02:22:00,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:22:00,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:22:00,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:22:00,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:22:00,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099688237] [2025-01-10 02:22:00,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099688237] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:22:00,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356043445] [2025-01-10 02:22:00,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:22:00,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:22:00,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:22:00,570 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 02:22:00,571 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 02:22:00,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 02:22:00,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 02:22:00,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:22:00,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:22:00,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:22:00,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:22:00,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:22:00,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:22:00,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:22:00,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356043445] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:22:00,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:22:00,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-10 02:22:00,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375277952] [2025-01-10 02:22:00,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:22:00,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 02:22:00,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:22:00,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 02:22:00,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:22:00,739 INFO L87 Difference]: Start difference. First operand 99 states and 124 transitions. Second operand has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:22:00,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:22:00,846 INFO L93 Difference]: Finished difference Result 99 states and 124 transitions. [2025-01-10 02:22:00,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:22:00,846 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2025-01-10 02:22:00,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:22:00,847 INFO L225 Difference]: With dead ends: 99 [2025-01-10 02:22:00,847 INFO L226 Difference]: Without dead ends: 96 [2025-01-10 02:22:00,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-01-10 02:22:00,847 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 76 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:22:00,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 52 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:22:00,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-10 02:22:00,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-01-10 02:22:00,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 90 states have internal predecessors, (109), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:22:00,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 117 transitions. [2025-01-10 02:22:00,858 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 117 transitions. Word has length 27 [2025-01-10 02:22:00,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:22:00,858 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 117 transitions. [2025-01-10 02:22:00,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:22:00,858 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2025-01-10 02:22:00,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-10 02:22:00,859 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:22:00,859 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:22:00,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 02:22:01,059 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 02:22:01,059 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 02:22:01,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:22:01,060 INFO L85 PathProgramCache]: Analyzing trace with hash 227685658, now seen corresponding path program 1 times [2025-01-10 02:22:01,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:22:01,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119972124] [2025-01-10 02:22:01,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:22:01,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:22:01,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 02:22:01,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 02:22:01,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:22:01,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:22:01,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:22:01,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:22:01,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119972124] [2025-01-10 02:22:01,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119972124] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:22:01,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373579283] [2025-01-10 02:22:01,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:22:01,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:22:01,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:22:01,125 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 02:22:01,126 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 02:22:01,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 02:22:01,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 02:22:01,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:22:01,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:22:01,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:22:01,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:22:01,222 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:22:01,222 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:22:01,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:22:01,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373579283] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:22:01,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:22:01,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-10 02:22:01,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640764561] [2025-01-10 02:22:01,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:22:01,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 02:22:01,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:22:01,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 02:22:01,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:22:01,274 INFO L87 Difference]: Start difference. First operand 96 states and 117 transitions. Second operand has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:22:01,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:22:01,411 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2025-01-10 02:22:01,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:22:01,412 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2025-01-10 02:22:01,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:22:01,412 INFO L225 Difference]: With dead ends: 108 [2025-01-10 02:22:01,412 INFO L226 Difference]: Without dead ends: 101 [2025-01-10 02:22:01,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=72, Unknown=0, NotChecked=0, Total=132 [2025-01-10 02:22:01,413 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 73 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:22:01,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 80 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:22:01,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-10 02:22:01,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2025-01-10 02:22:01,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 85 states have internal predecessors, (97), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:22:01,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 105 transitions. [2025-01-10 02:22:01,418 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 105 transitions. Word has length 28 [2025-01-10 02:22:01,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:22:01,418 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 105 transitions. [2025-01-10 02:22:01,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:22:01,418 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2025-01-10 02:22:01,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 02:22:01,418 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:22:01,418 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:22:01,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 02:22:01,623 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 02:22:01,623 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 02:22:01,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:22:01,624 INFO L85 PathProgramCache]: Analyzing trace with hash -237413092, now seen corresponding path program 1 times [2025-01-10 02:22:01,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:22:01,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30564782] [2025-01-10 02:22:01,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:22:01,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:22:01,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 02:22:01,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 02:22:01,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:22:01,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:22:01,688 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:22:01,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:22:01,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30564782] [2025-01-10 02:22:01,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30564782] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:22:01,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410243816] [2025-01-10 02:22:01,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:22:01,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:22:01,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:22:01,690 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 02:22:01,692 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 02:22:01,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 02:22:01,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 02:22:01,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:22:01,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:22:01,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 02:22:01,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:22:01,829 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:22:01,829 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:22:01,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410243816] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:22:01,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:22:01,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-01-10 02:22:01,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182292124] [2025-01-10 02:22:01,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:22:01,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:22:01,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:22:01,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:22:01,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:22:01,831 INFO L87 Difference]: Start difference. First operand 91 states and 105 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:22:01,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:22:01,892 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2025-01-10 02:22:01,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:22:01,893 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-01-10 02:22:01,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:22:01,893 INFO L225 Difference]: With dead ends: 91 [2025-01-10 02:22:01,893 INFO L226 Difference]: Without dead ends: 79 [2025-01-10 02:22:01,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:22:01,894 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:22:01,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 50 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:22:01,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-01-10 02:22:01,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-01-10 02:22:01,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 69 states have (on average 1.144927536231884) internal successors, (79), 73 states have internal predecessors, (79), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:22:01,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2025-01-10 02:22:01,897 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 30 [2025-01-10 02:22:01,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:22:01,897 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2025-01-10 02:22:01,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:22:01,898 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2025-01-10 02:22:01,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-10 02:22:01,898 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:22:01,898 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:22:01,904 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 02:22:02,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-10 02:22:02,102 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 02:22:02,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:22:02,102 INFO L85 PathProgramCache]: Analyzing trace with hash 2090887808, now seen corresponding path program 1 times [2025-01-10 02:22:02,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:22:02,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281886440] [2025-01-10 02:22:02,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:22:02,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:22:02,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 02:22:02,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 02:22:02,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:22:02,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:22:02,145 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:22:02,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:22:02,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281886440] [2025-01-10 02:22:02,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281886440] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:22:02,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247391911] [2025-01-10 02:22:02,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:22:02,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:22:02,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:22:02,148 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 02:22:02,149 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 02:22:02,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 02:22:02,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 02:22:02,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:22:02,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:22:02,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:22:02,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:22:02,204 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:22:02,204 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:22:02,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247391911] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:22:02,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:22:02,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 02:22:02,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125073792] [2025-01-10 02:22:02,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:22:02,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:22:02,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:22:02,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:22:02,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:22:02,205 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:22:02,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:22:02,218 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2025-01-10 02:22:02,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:22:02,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2025-01-10 02:22:02,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:22:02,219 INFO L225 Difference]: With dead ends: 79 [2025-01-10 02:22:02,219 INFO L226 Difference]: Without dead ends: 78 [2025-01-10 02:22:02,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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 02:22:02,219 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:22:02,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 49 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:22:02,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-10 02:22:02,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-01-10 02:22:02,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 72 states have internal predecessors, (76), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:22:02,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2025-01-10 02:22:02,225 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 39 [2025-01-10 02:22:02,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:22:02,225 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2025-01-10 02:22:02,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:22:02,225 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2025-01-10 02:22:02,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-10 02:22:02,226 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:22:02,226 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:22:02,233 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 02:22:02,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-10 02:22:02,430 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 02:22:02,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:22:02,430 INFO L85 PathProgramCache]: Analyzing trace with hash 393012676, now seen corresponding path program 1 times [2025-01-10 02:22:02,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:22:02,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014946500] [2025-01-10 02:22:02,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:22:02,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:22:02,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-10 02:22:02,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 02:22:02,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:22:02,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:22:02,477 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:22:02,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:22:02,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014946500] [2025-01-10 02:22:02,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014946500] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:22:02,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574670945] [2025-01-10 02:22:02,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:22:02,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:22:02,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:22:02,480 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 02:22:02,486 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 02:22:02,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-10 02:22:02,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 02:22:02,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:22:02,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:22:02,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:22:02,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:22:02,548 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:22:02,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:22:02,611 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:22:02,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574670945] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:22:02,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:22:02,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 02:22:02,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656334600] [2025-01-10 02:22:02,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:22:02,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:22:02,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:22:02,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:22:02,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:22:02,612 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:22:02,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:22:02,651 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2025-01-10 02:22:02,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:22:02,651 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 40 [2025-01-10 02:22:02,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:22:02,652 INFO L225 Difference]: With dead ends: 91 [2025-01-10 02:22:02,653 INFO L226 Difference]: Without dead ends: 90 [2025-01-10 02:22:02,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 76 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 02:22:02,653 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:22:02,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 99 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:22:02,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-01-10 02:22:02,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2025-01-10 02:22:02,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 78 states have (on average 1.0769230769230769) internal successors, (84), 81 states have internal predecessors, (84), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:22:02,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2025-01-10 02:22:02,659 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 40 [2025-01-10 02:22:02,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:22:02,660 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2025-01-10 02:22:02,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:22:02,661 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2025-01-10 02:22:02,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-10 02:22:02,661 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:22:02,661 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-01-10 02:22:02,667 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 02:22:02,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:22:02,862 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 02:22:02,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:22:02,862 INFO L85 PathProgramCache]: Analyzing trace with hash -431714182, now seen corresponding path program 1 times [2025-01-10 02:22:02,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:22:02,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791935863] [2025-01-10 02:22:02,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:22:02,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:22:02,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-10 02:22:02,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-10 02:22:02,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:22:02,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:22:02,969 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:22:02,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:22:02,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791935863] [2025-01-10 02:22:02,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791935863] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:22:02,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132956151] [2025-01-10 02:22:02,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:22:02,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:22:02,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:22:02,971 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 02:22:02,972 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 02:22:02,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-10 02:22:03,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-10 02:22:03,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:22:03,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:22:03,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 02:22:03,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:22:03,178 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:22:03,178 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:22:03,296 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:22:03,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132956151] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:22:03,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:22:03,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-01-10 02:22:03,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795355292] [2025-01-10 02:22:03,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:22:03,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-10 02:22:03,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:22:03,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 02:22:03,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2025-01-10 02:22:03,297 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 20 states, 19 states have (on average 7.578947368421052) internal successors, (144), 20 states have internal predecessors, (144), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 02:22:03,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:22:03,508 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2025-01-10 02:22:03,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 02:22:03,509 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 7.578947368421052) internal successors, (144), 20 states have internal predecessors, (144), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 64 [2025-01-10 02:22:03,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:22:03,510 INFO L225 Difference]: With dead ends: 127 [2025-01-10 02:22:03,510 INFO L226 Difference]: Without dead ends: 126 [2025-01-10 02:22:03,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=248, Invalid=402, Unknown=0, NotChecked=0, Total=650 [2025-01-10 02:22:03,511 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:22:03,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 95 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:22:03,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-01-10 02:22:03,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2025-01-10 02:22:03,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 112 states have (on average 1.0982142857142858) internal successors, (123), 115 states have internal predecessors, (123), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 02:22:03,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 137 transitions. [2025-01-10 02:22:03,520 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 137 transitions. Word has length 64 [2025-01-10 02:22:03,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:22:03,521 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 137 transitions. [2025-01-10 02:22:03,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 7.578947368421052) internal successors, (144), 20 states have internal predecessors, (144), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 02:22:03,521 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 137 transitions. [2025-01-10 02:22:03,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-10 02:22:03,521 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:22:03,522 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2025-01-10 02:22:03,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 02:22:03,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:22:03,722 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 02:22:03,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:22:03,723 INFO L85 PathProgramCache]: Analyzing trace with hash 407402110, now seen corresponding path program 2 times [2025-01-10 02:22:03,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:22:03,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41417479] [2025-01-10 02:22:03,723 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:22:03,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:22:03,728 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-01-10 02:22:03,737 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 02:22:03,737 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:22:03,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:22:03,835 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:22:03,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:22:03,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41417479] [2025-01-10 02:22:03,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41417479] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:22:03,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869631693] [2025-01-10 02:22:03,835 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:22:03,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:22:03,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:22:03,837 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 02:22:03,851 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 02:22:03,872 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-01-10 02:22:03,886 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 02:22:03,887 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:22:03,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:22:03,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 02:22:03,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:22:04,050 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:22:04,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:22:04,181 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:22:04,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869631693] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:22:04,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:22:04,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-01-10 02:22:04,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108316936] [2025-01-10 02:22:04,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:22:04,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 02:22:04,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:22:04,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 02:22:04,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=297, Unknown=0, NotChecked=0, Total=462 [2025-01-10 02:22:04,182 INFO L87 Difference]: Start difference. First operand 124 states and 137 transitions. Second operand has 22 states, 21 states have (on average 7.238095238095238) internal successors, (152), 22 states have internal predecessors, (152), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 02:22:04,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:22:04,417 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2025-01-10 02:22:04,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 02:22:04,418 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 7.238095238095238) internal successors, (152), 22 states have internal predecessors, (152), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 68 [2025-01-10 02:22:04,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:22:04,418 INFO L225 Difference]: With dead ends: 132 [2025-01-10 02:22:04,418 INFO L226 Difference]: Without dead ends: 131 [2025-01-10 02:22:04,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=321, Invalid=549, Unknown=0, NotChecked=0, Total=870 [2025-01-10 02:22:04,420 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 72 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:22:04,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 97 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:22:04,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-01-10 02:22:04,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2025-01-10 02:22:04,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 116 states have (on average 1.0775862068965518) internal successors, (125), 119 states have internal predecessors, (125), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 02:22:04,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2025-01-10 02:22:04,428 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 68 [2025-01-10 02:22:04,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:22:04,428 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2025-01-10 02:22:04,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 7.238095238095238) internal successors, (152), 22 states have internal predecessors, (152), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 02:22:04,428 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2025-01-10 02:22:04,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-10 02:22:04,429 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:22:04,429 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-01-10 02:22:04,435 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 02:22:04,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:22:04,632 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 02:22:04,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:22:04,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1742033198, now seen corresponding path program 2 times [2025-01-10 02:22:04,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:22:04,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958875654] [2025-01-10 02:22:04,633 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:22:04,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:22:04,650 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-01-10 02:22:04,659 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-01-10 02:22:04,659 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:22:04,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:22:04,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1534577706] [2025-01-10 02:22:04,659 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:22:04,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:22:04,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:22:04,661 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 02:22:04,663 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 02:22:04,682 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-01-10 02:22:04,697 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-01-10 02:22:04,697 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:22:04,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:22:04,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 02:22:04,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:22:04,780 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 02:22:04,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:22:04,946 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 02:22:04,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:22:04,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958875654] [2025-01-10 02:22:04,946 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:22:04,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534577706] [2025-01-10 02:22:04,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534577706] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:22:04,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:22:04,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-01-10 02:22:04,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47427691] [2025-01-10 02:22:04,947 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:22:04,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 02:22:04,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:22:04,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 02:22:04,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-01-10 02:22:04,948 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand has 12 states, 11 states have (on average 12.0) internal successors, (132), 12 states have internal predecessors, (132), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 02:22:05,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:22:05,193 INFO L93 Difference]: Finished difference Result 182 states and 199 transitions. [2025-01-10 02:22:05,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 02:22:05,194 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 12.0) internal successors, (132), 12 states have internal predecessors, (132), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 86 [2025-01-10 02:22:05,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:22:05,195 INFO L225 Difference]: With dead ends: 182 [2025-01-10 02:22:05,195 INFO L226 Difference]: Without dead ends: 181 [2025-01-10 02:22:05,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2025-01-10 02:22:05,196 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 91 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:22:05,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 251 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:22:05,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-01-10 02:22:05,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 174. [2025-01-10 02:22:05,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 159 states have (on average 1.0880503144654088) internal successors, (173), 162 states have internal predecessors, (173), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 02:22:05,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 193 transitions. [2025-01-10 02:22:05,202 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 193 transitions. Word has length 86 [2025-01-10 02:22:05,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:22:05,203 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 193 transitions. [2025-01-10 02:22:05,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 12.0) internal successors, (132), 12 states have internal predecessors, (132), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 02:22:05,203 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 193 transitions. [2025-01-10 02:22:05,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-10 02:22:05,203 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:22:05,204 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-01-10 02:22:05,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 02:22:05,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-10 02:22:05,405 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 02:22:05,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:22:05,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1954462886, now seen corresponding path program 2 times [2025-01-10 02:22:05,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:22:05,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642589930] [2025-01-10 02:22:05,406 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:22:05,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:22:05,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 100 statements into 2 equivalence classes. [2025-01-10 02:22:05,411 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 100 statements. [2025-01-10 02:22:05,411 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 02:22:05,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:22:05,425 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-01-10 02:22:05,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:22:05,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642589930] [2025-01-10 02:22:05,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642589930] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:22:05,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40535771] [2025-01-10 02:22:05,426 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:22:05,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:22:05,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:22:05,427 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:22:05,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 02:22:05,460 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 100 statements into 2 equivalence classes. [2025-01-10 02:22:05,465 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 100 statements. [2025-01-10 02:22:05,465 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 02:22:05,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:22:05,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:22:05,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:22:05,535 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-01-10 02:22:05,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:22:05,628 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-01-10 02:22:05,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40535771] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:22:05,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:22:05,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-01-10 02:22:05,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577381522] [2025-01-10 02:22:05,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:22:05,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:22:05,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:22:05,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:22:05,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:22:05,630 INFO L87 Difference]: Start difference. First operand 174 states and 193 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:22:05,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:22:05,654 INFO L93 Difference]: Finished difference Result 174 states and 193 transitions. [2025-01-10 02:22:05,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:22:05,654 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 100 [2025-01-10 02:22:05,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:22:05,655 INFO L225 Difference]: With dead ends: 174 [2025-01-10 02:22:05,655 INFO L226 Difference]: Without dead ends: 173 [2025-01-10 02:22:05,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:22:05,656 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 37 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:22:05,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 50 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:22:05,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-01-10 02:22:05,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-01-10 02:22:05,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 159 states have (on average 1.050314465408805) internal successors, (167), 161 states have internal predecessors, (167), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 02:22:05,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 187 transitions. [2025-01-10 02:22:05,662 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 187 transitions. Word has length 100 [2025-01-10 02:22:05,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:22:05,663 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 187 transitions. [2025-01-10 02:22:05,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:22:05,663 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 187 transitions. [2025-01-10 02:22:05,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-10 02:22:05,664 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:22:05,664 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1] [2025-01-10 02:22:05,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 02:22:05,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 02:22:05,864 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 02:22:05,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:22:05,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1354439490, now seen corresponding path program 2 times [2025-01-10 02:22:05,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:22:05,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049304616] [2025-01-10 02:22:05,865 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:22:05,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:22:05,873 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 144 statements into 2 equivalence classes. [2025-01-10 02:22:05,895 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 144 of 144 statements. [2025-01-10 02:22:05,896 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:22:05,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:22:06,177 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 336 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-10 02:22:06,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:22:06,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049304616] [2025-01-10 02:22:06,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049304616] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:22:06,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360077828] [2025-01-10 02:22:06,177 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:22:06,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:22:06,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:22:06,179 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:22:06,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 02:22:06,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 144 statements into 2 equivalence classes. [2025-01-10 02:22:06,212 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 144 statements. [2025-01-10 02:22:06,212 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 02:22:06,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:22:06,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 02:22:06,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:22:06,368 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-01-10 02:22:06,369 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:22:06,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360077828] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:22:06,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:22:06,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 20 [2025-01-10 02:22:06,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446362913] [2025-01-10 02:22:06,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:22:06,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:22:06,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:22:06,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:22:06,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2025-01-10 02:22:06,370 INFO L87 Difference]: Start difference. First operand 173 states and 187 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:22:06,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:22:06,447 INFO L93 Difference]: Finished difference Result 175 states and 189 transitions. [2025-01-10 02:22:06,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:22:06,448 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 144 [2025-01-10 02:22:06,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:22:06,449 INFO L225 Difference]: With dead ends: 175 [2025-01-10 02:22:06,449 INFO L226 Difference]: Without dead ends: 174 [2025-01-10 02:22:06,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-01-10 02:22:06,449 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:22:06,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 45 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:22:06,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-01-10 02:22:06,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2025-01-10 02:22:06,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 159 states have (on average 1.0251572327044025) internal successors, (163), 160 states have internal predecessors, (163), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 02:22:06,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 183 transitions. [2025-01-10 02:22:06,456 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 183 transitions. Word has length 144 [2025-01-10 02:22:06,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:22:06,456 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 183 transitions. [2025-01-10 02:22:06,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:22:06,456 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 183 transitions. [2025-01-10 02:22:06,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-10 02:22:06,457 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:22:06,457 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2025-01-10 02:22:06,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-10 02:22:06,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 02:22:06,657 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 02:22:06,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:22:06,658 INFO L85 PathProgramCache]: Analyzing trace with hash -76784314, now seen corresponding path program 3 times [2025-01-10 02:22:06,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:22:06,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899246934] [2025-01-10 02:22:06,658 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:22:06,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:22:06,665 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 148 statements into 8 equivalence classes. [2025-01-10 02:22:06,705 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 148 of 148 statements. [2025-01-10 02:22:06,705 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-01-10 02:22:06,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:22:06,989 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 0 proven. 364 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-10 02:22:06,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:22:06,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899246934] [2025-01-10 02:22:06,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899246934] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:22:06,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881319773] [2025-01-10 02:22:06,990 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:22:06,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:22:06,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:22:06,992 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:22:06,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 02:22:07,015 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 148 statements into 8 equivalence classes. [2025-01-10 02:22:07,023 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 148 statements. [2025-01-10 02:22:07,023 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 02:22:07,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:22:07,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 02:22:07,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:22:27,244 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= (mod (+ |ULTIMATE.start_main_~y~0#1| .cse0) 2) 0) (<= .cse0 9223372036854775807) (<= |c_ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~y~0#1| (div (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) .cse0) 2)))))) is different from true [2025-01-10 02:22:31,261 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-01-10 02:22:31,261 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:22:31,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881319773] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:22:31,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:22:31,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [16] total 23 [2025-01-10 02:22:31,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168848645] [2025-01-10 02:22:31,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:22:31,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 02:22:31,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:22:31,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 02:22:31,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=423, Unknown=1, NotChecked=42, Total=552 [2025-01-10 02:22:31,264 INFO L87 Difference]: Start difference. First operand 172 states and 183 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:22:44,310 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification. DAG size of input: 22 DAG size of output: 31 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-10 02:22:52,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:22:52,450 INFO L93 Difference]: Finished difference Result 174 states and 185 transitions. [2025-01-10 02:22:52,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 02:22:52,450 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 148 [2025-01-10 02:22:52,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:22:52,451 INFO L225 Difference]: With dead ends: 174 [2025-01-10 02:22:52,451 INFO L226 Difference]: Without dead ends: 173 [2025-01-10 02:22:52,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 141 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 29.0s TimeCoverageRelationStatistics Valid=116, Invalid=641, Unknown=3, NotChecked=52, Total=812 [2025-01-10 02:22:52,452 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 45 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 02:22:52,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 39 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 84 Invalid, 0 Unknown, 40 Unchecked, 0.4s Time] [2025-01-10 02:22:52,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-01-10 02:22:52,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2025-01-10 02:22:52,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 159 states have (on average 1.0062893081761006) internal successors, (160), 159 states have internal predecessors, (160), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 02:22:52,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 180 transitions. [2025-01-10 02:22:52,462 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 180 transitions. Word has length 148 [2025-01-10 02:22:52,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:22:52,462 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 180 transitions. [2025-01-10 02:22:52,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:22:52,463 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 180 transitions. [2025-01-10 02:22:52,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-10 02:22:52,464 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:22:52,464 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2025-01-10 02:22:52,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-01-10 02:22:52,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:22:52,665 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 02:22:52,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:22:52,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1200838054, now seen corresponding path program 3 times [2025-01-10 02:22:52,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:22:52,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268465453] [2025-01-10 02:22:52,666 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:22:52,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:22:52,674 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 206 statements into 11 equivalence classes. [2025-01-10 02:22:52,720 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 206 of 206 statements. [2025-01-10 02:22:52,721 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 02:22:52,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:22:53,119 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 634 proven. 106 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-10 02:22:53,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:22:53,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268465453] [2025-01-10 02:22:53,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268465453] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:22:53,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006478821] [2025-01-10 02:22:53,121 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:22:53,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:22:53,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:22:53,123 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:22:53,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-10 02:22:53,158 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 206 statements into 11 equivalence classes. [2025-01-10 02:22:53,238 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 206 of 206 statements. [2025-01-10 02:22:53,238 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 02:22:53,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:22:53,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 02:22:53,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:22:54,172 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 740 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-10 02:22:54,172 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:22:54,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006478821] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:22:54,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:22:54,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [14] total 26 [2025-01-10 02:22:54,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824806135] [2025-01-10 02:22:54,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:22:54,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 02:22:54,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:22:54,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 02:22:54,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2025-01-10 02:22:54,174 INFO L87 Difference]: Start difference. First operand 171 states and 180 transitions. Second operand has 14 states, 14 states have (on average 11.357142857142858) internal successors, (159), 14 states have internal predecessors, (159), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 02:22:54,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:22:54,265 INFO L93 Difference]: Finished difference Result 175 states and 183 transitions. [2025-01-10 02:22:54,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 02:22:54,266 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 11.357142857142858) internal successors, (159), 14 states have internal predecessors, (159), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 206 [2025-01-10 02:22:54,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:22:54,266 INFO L225 Difference]: With dead ends: 175 [2025-01-10 02:22:54,266 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 02:22:54,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2025-01-10 02:22:54,268 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:22:54,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 422 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:22:54,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 02:22:54,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 02:22:54,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:22:54,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 02:22:54,268 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 206 [2025-01-10 02:22:54,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:22:54,268 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 02:22:54,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.357142857142858) internal successors, (159), 14 states have internal predecessors, (159), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 02:22:54,269 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 02:22:54,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 02:22:54,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2025-01-10 02:22:54,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2025-01-10 02:22:54,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2025-01-10 02:22:54,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2025-01-10 02:22:54,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2025-01-10 02:22:54,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2025-01-10 02:22:54,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2025-01-10 02:22:54,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2025-01-10 02:22:54,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2025-01-10 02:22:54,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2025-01-10 02:22:54,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2025-01-10 02:22:54,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2025-01-10 02:22:54,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2025-01-10 02:22:54,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2025-01-10 02:22:54,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2025-01-10 02:22:54,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2025-01-10 02:22:54,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2025-01-10 02:22:54,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2025-01-10 02:22:54,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2025-01-10 02:22:54,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2025-01-10 02:22:54,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2025-01-10 02:22:54,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2025-01-10 02:22:54,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-01-10 02:22:54,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:22:54,478 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:22:54,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 02:23:03,312 WARN L286 SmtUtils]: Spent 8.81s on a formula simplification. DAG size of input: 70 DAG size of output: 61 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2025-01-10 02:23:11,501 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification. DAG size of input: 70 DAG size of output: 61 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2025-01-10 02:23:11,508 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 02:23:11,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:23:11 BoogieIcfgContainer [2025-01-10 02:23:11,522 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 02:23:11,523 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 02:23:11,523 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 02:23:11,523 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 02:23:11,524 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:21:58" (3/4) ... [2025-01-10 02:23:11,525 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 02:23:11,530 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-01-10 02:23:11,536 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-10 02:23:11,537 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 02:23:11,538 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 02:23:11,538 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 02:23:11,598 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 02:23:11,599 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 02:23:11,599 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 02:23:11,599 INFO L158 Benchmark]: Toolchain (without parser) took 73462.09ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 105.6MB in the beginning and 120.5MB in the end (delta: -14.9MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2025-01-10 02:23:11,600 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:23:11,600 INFO L158 Benchmark]: CACSL2BoogieTranslator took 160.39ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 94.8MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:23:11,600 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.87ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:23:11,600 INFO L158 Benchmark]: Boogie Preprocessor took 33.61ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 91.8MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:23:11,600 INFO L158 Benchmark]: RCFGBuilder took 247.58ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 79.1MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:23:11,600 INFO L158 Benchmark]: TraceAbstraction took 72917.53ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 78.0MB in the beginning and 126.8MB in the end (delta: -48.8MB). Peak memory consumption was 69.1MB. Max. memory is 16.1GB. [2025-01-10 02:23:11,601 INFO L158 Benchmark]: Witness Printer took 75.71ms. Allocated memory is still 176.2MB. Free memory was 126.8MB in the beginning and 120.5MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:23:11,601 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 160.39ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 94.8MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.87ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.61ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 91.8MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 247.58ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 79.1MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 72917.53ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 78.0MB in the beginning and 126.8MB in the end (delta: -48.8MB). Peak memory consumption was 69.1MB. Max. memory is 16.1GB. * Witness Printer took 75.71ms. Allocated memory is still 176.2MB. Free memory was 126.8MB in the beginning and 120.5MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 55.8s, OverallIterations: 20, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 23.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 627 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 617 mSDsluCounter, 1874 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 40 IncrementalHoareTripleChecker+Unchecked, 1242 mSDsCounter, 98 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1945 IncrementalHoareTripleChecker+Invalid, 2083 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 98 mSolverCounterUnsat, 632 mSDtfsCounter, 1945 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1558 GetRequests, 1364 SyntacticMatches, 2 SemanticMatches, 192 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 30.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=16, InterpolantAutomatonStates: 134, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 78 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 28.7s InterpolantComputationTime, 2112 NumberOfCodeBlocks, 1712 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 2394 ConstructedInterpolants, 4 QuantifiedInterpolants, 10301 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1400 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 39 InterpolantComputations, 12 PerfectInterpolantSequences, 3455/4895 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 22 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((((((((((((0 <= k) && (2 <= x)) && (2 <= c)) && (2 == y)) && (x <= 3)) && (k <= 5)) && (c <= 9223372036854775805)) || (((((0 <= k) && (c == 1)) && (x == 1)) && (k <= 5)) && (y == 1))) || (((((((0 <= k) && (y == 4)) && (c <= 9223372036854775806)) && (x <= 10)) && (k <= 5)) && (4 <= c)) && (4 <= x))) || (((((0 <= k) && (c == 0)) && (y == 0)) && (k <= 5)) && (x == 0))) || (((((((((0 <= k) && (c <= 9223372036854775806)) && (1 <= y)) && ((((y + ((__int128) y * y)) >= 0) ? ((y + ((__int128) y * y)) % 2) : (((y + ((__int128) y * y)) % 2) + 2)) == 0)) && (x <= (y + (((((__int128) -1 * y) + ((__int128) y * y)) >= 0) ? ((((__int128) -1 * y) + ((__int128) y * y)) / 2) : (((((__int128) -1 * y) + ((__int128) y * y)) / 2) - 1))))) && (y <= x)) && (k <= 5)) && ((((__int128) y * 8) + ((__int128) y * y)) <= 9223372036854775791)) && (5 <= c))) || (((((((0 <= k) && (c <= 9223372036854775806)) && (3 == y)) && (k <= 5)) && (3 <= c)) && (x <= 6)) && (3 <= x))) RESULT: Ultimate proved your program to be correct! [2025-01-10 02:23:11,812 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-01-10 02:23:11,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE