./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound2.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/ps6-ll_unwindbound2.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 d04c68f644b4e34369c0299cad48e6ffd2dffe6006909b97954ecd16248ddfba --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:27:04,458 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:27:04,526 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:27:04,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:27:04,531 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:27:04,557 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:27:04,560 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:27:04,560 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:27:04,560 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:27:04,560 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:27:04,561 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:27:04,561 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:27:04,562 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:27:04,562 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:27:04,562 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:27:04,562 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:27:04,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:27:04,563 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:27:04,563 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:27:04,563 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:27:04,563 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:27:04,563 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:27:04,564 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:27:04,564 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:27:04,564 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:27:04,564 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:27:04,564 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:27:04,564 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:27:04,564 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:27:04,564 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:27:04,564 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:27:04,565 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:27:04,565 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:27:04,565 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:27:04,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:27:04,565 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:27:04,566 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:27:04,566 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:27:04,566 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:27:04,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:27:04,566 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:27:04,566 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:27:04,566 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:27:04,566 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:27:04,567 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:27:04,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:27:04,567 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:27:04,567 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:27:04,567 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:27:04,567 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:27:04,567 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 -> d04c68f644b4e34369c0299cad48e6ffd2dffe6006909b97954ecd16248ddfba [2025-01-10 02:27:04,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:27:04,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:27:04,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:27:04,852 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:27:04,852 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:27:04,853 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound2.c [2025-01-10 02:27:06,100 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/636da8806/8bd2209a7846472d99e7b5ad8b8e5be9/FLAGa5784fd19 [2025-01-10 02:27:06,333 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:27:06,335 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound2.c [2025-01-10 02:27:06,343 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/636da8806/8bd2209a7846472d99e7b5ad8b8e5be9/FLAGa5784fd19 [2025-01-10 02:27:06,359 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/636da8806/8bd2209a7846472d99e7b5ad8b8e5be9 [2025-01-10 02:27:06,362 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:27:06,364 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:27:06,365 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:27:06,365 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:27:06,369 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:27:06,369 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:27:06" (1/1) ... [2025-01-10 02:27:06,370 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4588780e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:27:06, skipping insertion in model container [2025-01-10 02:27:06,370 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:27:06" (1/1) ... [2025-01-10 02:27:06,383 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:27:06,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:27:06,540 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:27:06,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:27:06,583 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:27:06,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:27:06 WrapperNode [2025-01-10 02:27:06,584 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:27:06,585 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:27:06,585 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:27:06,585 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:27:06,593 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:27:06" (1/1) ... [2025-01-10 02:27:06,599 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:27:06" (1/1) ... [2025-01-10 02:27:06,630 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 152 [2025-01-10 02:27:06,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:27:06,634 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:27:06,634 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:27:06,634 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:27:06,644 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:27:06" (1/1) ... [2025-01-10 02:27:06,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:27:06" (1/1) ... [2025-01-10 02:27:06,652 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:27:06" (1/1) ... [2025-01-10 02:27:06,662 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:27:06,663 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:27:06" (1/1) ... [2025-01-10 02:27:06,663 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:27:06" (1/1) ... [2025-01-10 02:27:06,666 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:27:06" (1/1) ... [2025-01-10 02:27:06,667 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:27:06" (1/1) ... [2025-01-10 02:27:06,672 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:27:06" (1/1) ... [2025-01-10 02:27:06,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:27:06" (1/1) ... [2025-01-10 02:27:06,674 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:27:06" (1/1) ... [2025-01-10 02:27:06,675 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:27:06,678 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:27:06,678 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:27:06,678 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:27:06,679 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:27:06" (1/1) ... [2025-01-10 02:27:06,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:27:06,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:27:06,707 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:27:06,710 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:27:06,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:27:06,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:27:06,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:27:06,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:27:06,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 02:27:06,730 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 02:27:06,780 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:27:06,781 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:27:07,294 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2025-01-10 02:27:07,294 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:27:07,312 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:27:07,314 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 02:27:07,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:27:07 BoogieIcfgContainer [2025-01-10 02:27:07,314 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:27:07,316 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:27:07,317 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:27:07,321 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:27:07,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:27:06" (1/3) ... [2025-01-10 02:27:07,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@311bf396 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:27:07, skipping insertion in model container [2025-01-10 02:27:07,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:27:06" (2/3) ... [2025-01-10 02:27:07,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@311bf396 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:27:07, skipping insertion in model container [2025-01-10 02:27:07,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:27:07" (3/3) ... [2025-01-10 02:27:07,325 INFO L128 eAbstractionObserver]: Analyzing ICFG ps6-ll_unwindbound2.c [2025-01-10 02:27:07,340 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:27:07,341 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ps6-ll_unwindbound2.c that has 2 procedures, 228 locations, 1 initial locations, 1 loop locations, and 104 error locations. [2025-01-10 02:27:07,392 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:27:07,402 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;@3fa86c08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:27:07,403 INFO L334 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2025-01-10 02:27:07,406 INFO L276 IsEmpty]: Start isEmpty. Operand has 228 states, 119 states have (on average 1.915966386554622) internal successors, (228), 223 states have internal predecessors, (228), 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:27:07,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 02:27:07,410 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:07,410 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 02:27:07,410 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-01-10 02:27:07,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:07,415 INFO L85 PathProgramCache]: Analyzing trace with hash 889508744, now seen corresponding path program 1 times [2025-01-10 02:27:07,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:07,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529184019] [2025-01-10 02:27:07,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:07,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:07,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 02:27:07,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 02:27:07,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:07,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:07,537 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:27:07,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:07,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529184019] [2025-01-10 02:27:07,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529184019] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:27:07,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:27:07,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:27:07,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462790612] [2025-01-10 02:27:07,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:27:07,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 02:27:07,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:07,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 02:27:07,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 02:27:07,561 INFO L87 Difference]: Start difference. First operand has 228 states, 119 states have (on average 1.915966386554622) internal successors, (228), 223 states have internal predecessors, (228), 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) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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:27:07,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:07,600 INFO L93 Difference]: Finished difference Result 427 states and 466 transitions. [2025-01-10 02:27:07,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 02:27:07,601 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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:27:07,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:07,608 INFO L225 Difference]: With dead ends: 427 [2025-01-10 02:27:07,608 INFO L226 Difference]: Without dead ends: 196 [2025-01-10 02:27:07,612 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:27:07,615 INFO L435 NwaCegarLoop]: 205 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, 205 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:27:07,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:27:07,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-01-10 02:27:07,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-01-10 02:27:07,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 114 states have (on average 1.7017543859649122) internal successors, (194), 192 states have internal predecessors, (194), 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:27:07,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2025-01-10 02:27:07,666 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 6 [2025-01-10 02:27:07,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:07,667 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2025-01-10 02:27:07,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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:27:07,667 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2025-01-10 02:27:07,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 02:27:07,668 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:07,668 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 02:27:07,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 02:27:07,668 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-01-10 02:27:07,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:07,669 INFO L85 PathProgramCache]: Analyzing trace with hash 889568326, now seen corresponding path program 1 times [2025-01-10 02:27:07,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:07,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96831193] [2025-01-10 02:27:07,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:07,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:07,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 02:27:07,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 02:27:07,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:07,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:07,752 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:27:07,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:07,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96831193] [2025-01-10 02:27:07,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96831193] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:27:07,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:27:07,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:27:07,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788930285] [2025-01-10 02:27:07,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:27:07,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:27:07,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:07,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:27:07,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:27:07,757 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand has 4 states, 3 states have (on average 2.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:27:07,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:07,817 INFO L93 Difference]: Finished difference Result 196 states and 198 transitions. [2025-01-10 02:27:07,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:27:07,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.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:27:07,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:07,820 INFO L225 Difference]: With dead ends: 196 [2025-01-10 02:27:07,820 INFO L226 Difference]: Without dead ends: 195 [2025-01-10 02:27:07,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:27:07,821 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 194 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 381 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:27:07,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 381 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:27:07,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-01-10 02:27:07,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2025-01-10 02:27:07,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 114 states have (on average 1.6929824561403508) internal successors, (193), 191 states have internal predecessors, (193), 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:27:07,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 197 transitions. [2025-01-10 02:27:07,834 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 197 transitions. Word has length 6 [2025-01-10 02:27:07,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:07,835 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 197 transitions. [2025-01-10 02:27:07,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.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:27:07,835 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 197 transitions. [2025-01-10 02:27:07,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 02:27:07,835 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:07,837 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:27:07,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 02:27:07,837 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-01-10 02:27:07,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:07,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1806814377, now seen corresponding path program 1 times [2025-01-10 02:27:07,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:07,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557679060] [2025-01-10 02:27:07,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:07,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:07,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 02:27:07,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 02:27:07,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:07,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:07,891 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:27:07,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:07,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557679060] [2025-01-10 02:27:07,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557679060] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:27:07,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:27:07,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:27:07,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444084913] [2025-01-10 02:27:07,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:27:07,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:27:07,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:07,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:27:07,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:27:07,893 INFO L87 Difference]: Start difference. First operand 195 states and 197 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) 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:27:07,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:07,925 INFO L93 Difference]: Finished difference Result 285 states and 287 transitions. [2025-01-10 02:27:07,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:27:07,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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:27:07,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:07,929 INFO L225 Difference]: With dead ends: 285 [2025-01-10 02:27:07,929 INFO L226 Difference]: Without dead ends: 199 [2025-01-10 02:27:07,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:27:07,930 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 3 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:07,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 573 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:27:07,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-01-10 02:27:07,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-01-10 02:27:07,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 118 states have (on average 1.6694915254237288) internal successors, (197), 195 states have internal predecessors, (197), 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:27:07,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 201 transitions. [2025-01-10 02:27:07,941 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 201 transitions. Word has length 7 [2025-01-10 02:27:07,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:07,941 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 201 transitions. [2025-01-10 02:27:07,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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:27:07,942 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 201 transitions. [2025-01-10 02:27:07,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 02:27:07,942 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:07,942 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:27:07,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 02:27:07,943 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-01-10 02:27:07,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:07,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1181830318, now seen corresponding path program 1 times [2025-01-10 02:27:07,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:07,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612056048] [2025-01-10 02:27:07,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:07,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:07,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 02:27:07,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 02:27:07,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:07,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:08,001 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:27:08,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:08,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612056048] [2025-01-10 02:27:08,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612056048] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:27:08,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:27:08,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:27:08,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966931913] [2025-01-10 02:27:08,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:27:08,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:27:08,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:08,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:27:08,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:27:08,003 INFO L87 Difference]: Start difference. First operand 199 states and 201 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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:27:08,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:08,386 INFO L93 Difference]: Finished difference Result 359 states and 367 transitions. [2025-01-10 02:27:08,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:27:08,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2025-01-10 02:27:08,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:08,388 INFO L225 Difference]: With dead ends: 359 [2025-01-10 02:27:08,388 INFO L226 Difference]: Without dead ends: 295 [2025-01-10 02:27:08,388 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:27:08,389 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 98 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:08,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 137 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 02:27:08,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-01-10 02:27:08,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 289. [2025-01-10 02:27:08,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 207 states have (on average 1.429951690821256) internal successors, (296), 284 states have internal predecessors, (296), 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:27:08,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 302 transitions. [2025-01-10 02:27:08,401 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 302 transitions. Word has length 9 [2025-01-10 02:27:08,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:08,401 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 302 transitions. [2025-01-10 02:27:08,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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:27:08,401 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 302 transitions. [2025-01-10 02:27:08,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 02:27:08,402 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:08,402 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:27:08,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 02:27:08,402 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-01-10 02:27:08,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:08,403 INFO L85 PathProgramCache]: Analyzing trace with hash -965795404, now seen corresponding path program 1 times [2025-01-10 02:27:08,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:08,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654012355] [2025-01-10 02:27:08,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:08,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:08,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 02:27:08,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 02:27:08,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:08,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:08,525 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:27:08,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:08,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654012355] [2025-01-10 02:27:08,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654012355] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:27:08,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:27:08,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:27:08,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659196921] [2025-01-10 02:27:08,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:27:08,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:27:08,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:08,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:27:08,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:27:08,527 INFO L87 Difference]: Start difference. First operand 289 states and 302 transitions. Second operand has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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:27:08,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:08,597 INFO L93 Difference]: Finished difference Result 313 states and 320 transitions. [2025-01-10 02:27:08,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:27:08,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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 47 [2025-01-10 02:27:08,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:08,599 INFO L225 Difference]: With dead ends: 313 [2025-01-10 02:27:08,599 INFO L226 Difference]: Without dead ends: 306 [2025-01-10 02:27:08,600 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:27:08,602 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 68 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:08,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 359 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:27:08,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-01-10 02:27:08,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 288. [2025-01-10 02:27:08,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 206 states have (on average 1.4029126213592233) internal successors, (289), 283 states have internal predecessors, (289), 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:27:08,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 295 transitions. [2025-01-10 02:27:08,626 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 295 transitions. Word has length 47 [2025-01-10 02:27:08,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:08,627 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 295 transitions. [2025-01-10 02:27:08,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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:27:08,627 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 295 transitions. [2025-01-10 02:27:08,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-10 02:27:08,628 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:08,628 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:27:08,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 02:27:08,628 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-01-10 02:27:08,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:08,628 INFO L85 PathProgramCache]: Analyzing trace with hash -416443050, now seen corresponding path program 1 times [2025-01-10 02:27:08,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:08,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996355319] [2025-01-10 02:27:08,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:08,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:08,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 02:27:08,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 02:27:08,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:08,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:08,810 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:27:08,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:08,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996355319] [2025-01-10 02:27:08,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996355319] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:27:08,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:27:08,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:27:08,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171429119] [2025-01-10 02:27:08,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:27:08,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:27:08,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:08,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:27:08,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:27:08,813 INFO L87 Difference]: Start difference. First operand 288 states and 295 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:27:08,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:08,998 INFO L93 Difference]: Finished difference Result 308 states and 313 transitions. [2025-01-10 02:27:08,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:27:08,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-01-10 02:27:08,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:08,999 INFO L225 Difference]: With dead ends: 308 [2025-01-10 02:27:08,999 INFO L226 Difference]: Without dead ends: 265 [2025-01-10 02:27:09,000 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:27:09,000 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 154 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:09,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 284 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:27:09,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-01-10 02:27:09,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 247. [2025-01-10 02:27:09,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 165 states have (on average 1.490909090909091) internal successors, (246), 242 states have internal predecessors, (246), 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:27:09,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 252 transitions. [2025-01-10 02:27:09,009 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 252 transitions. Word has length 49 [2025-01-10 02:27:09,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:09,010 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 252 transitions. [2025-01-10 02:27:09,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:27:09,010 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 252 transitions. [2025-01-10 02:27:09,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-10 02:27:09,011 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:09,011 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:09,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 02:27:09,011 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-01-10 02:27:09,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:09,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1803361431, now seen corresponding path program 1 times [2025-01-10 02:27:09,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:09,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398644322] [2025-01-10 02:27:09,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:09,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:09,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-10 02:27:09,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-10 02:27:09,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:09,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:09,100 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:27:09,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:09,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398644322] [2025-01-10 02:27:09,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398644322] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:27:09,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:27:09,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:27:09,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888320185] [2025-01-10 02:27:09,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:27:09,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:27:09,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:09,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:27:09,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:27:09,104 INFO L87 Difference]: Start difference. First operand 247 states and 252 transitions. Second operand has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 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:27:09,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:09,121 INFO L93 Difference]: Finished difference Result 249 states and 252 transitions. [2025-01-10 02:27:09,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:27:09,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 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 57 [2025-01-10 02:27:09,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:09,123 INFO L225 Difference]: With dead ends: 249 [2025-01-10 02:27:09,123 INFO L226 Difference]: Without dead ends: 247 [2025-01-10 02:27:09,124 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:27:09,124 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 1 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 383 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:27:09,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 383 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:27:09,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-01-10 02:27:09,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2025-01-10 02:27:09,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 165 states have (on average 1.4787878787878788) internal successors, (244), 242 states have internal predecessors, (244), 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:27:09,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 250 transitions. [2025-01-10 02:27:09,133 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 250 transitions. Word has length 57 [2025-01-10 02:27:09,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:09,134 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 250 transitions. [2025-01-10 02:27:09,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 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:27:09,134 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 250 transitions. [2025-01-10 02:27:09,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-10 02:27:09,135 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:09,135 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:09,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 02:27:09,136 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-01-10 02:27:09,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:09,136 INFO L85 PathProgramCache]: Analyzing trace with hash 207466016, now seen corresponding path program 1 times [2025-01-10 02:27:09,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:09,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53784548] [2025-01-10 02:27:09,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:09,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:09,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-10 02:27:09,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-10 02:27:09,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:09,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:27:09,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [608452368] [2025-01-10 02:27:09,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:09,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:09,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:27:09,181 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:27:09,183 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:27:09,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-10 02:27:09,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-10 02:27:09,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:09,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:09,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:27:09,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:27:09,362 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:27:09,362 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:27:09,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:09,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53784548] [2025-01-10 02:27:09,363 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:27:09,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608452368] [2025-01-10 02:27:09,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608452368] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:27:09,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:27:09,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:27:09,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753789108] [2025-01-10 02:27:09,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:27:09,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:27:09,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:09,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:27:09,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:27:09,368 INFO L87 Difference]: Start difference. First operand 247 states and 250 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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:27:09,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:09,845 INFO L93 Difference]: Finished difference Result 426 states and 440 transitions. [2025-01-10 02:27:09,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:27:09,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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 62 [2025-01-10 02:27:09,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:09,848 INFO L225 Difference]: With dead ends: 426 [2025-01-10 02:27:09,851 INFO L226 Difference]: Without dead ends: 361 [2025-01-10 02:27:09,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 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:27:09,853 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 113 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:09,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 162 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 02:27:09,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-01-10 02:27:09,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 354. [2025-01-10 02:27:09,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 270 states have (on average 1.3518518518518519) internal successors, (365), 347 states have internal predecessors, (365), 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:27:09,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 375 transitions. [2025-01-10 02:27:09,868 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 375 transitions. Word has length 62 [2025-01-10 02:27:09,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:09,869 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 375 transitions. [2025-01-10 02:27:09,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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:27:09,870 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 375 transitions. [2025-01-10 02:27:09,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-10 02:27:09,871 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:09,871 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:09,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 02:27:10,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:10,072 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-01-10 02:27:10,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:10,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1398173795, now seen corresponding path program 1 times [2025-01-10 02:27:10,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:10,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418653128] [2025-01-10 02:27:10,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:10,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:10,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-10 02:27:10,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-10 02:27:10,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:10,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:10,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:27:10,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:10,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418653128] [2025-01-10 02:27:10,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418653128] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:27:10,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:27:10,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:27:10,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805778398] [2025-01-10 02:27:10,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:27:10,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:27:10,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:10,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:27:10,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:27:10,192 INFO L87 Difference]: Start difference. First operand 354 states and 375 transitions. Second operand has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 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:27:10,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:10,292 INFO L93 Difference]: Finished difference Result 355 states and 375 transitions. [2025-01-10 02:27:10,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:27:10,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 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 69 [2025-01-10 02:27:10,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:10,295 INFO L225 Difference]: With dead ends: 355 [2025-01-10 02:27:10,295 INFO L226 Difference]: Without dead ends: 354 [2025-01-10 02:27:10,295 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:27:10,296 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 58 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:10,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 317 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:27:10,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-01-10 02:27:10,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2025-01-10 02:27:10,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 270 states have (on average 1.348148148148148) internal successors, (364), 347 states have internal predecessors, (364), 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:27:10,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 374 transitions. [2025-01-10 02:27:10,307 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 374 transitions. Word has length 69 [2025-01-10 02:27:10,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:10,307 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 374 transitions. [2025-01-10 02:27:10,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 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:27:10,307 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 374 transitions. [2025-01-10 02:27:10,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-10 02:27:10,308 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:10,308 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:10,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 02:27:10,308 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-01-10 02:27:10,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:10,309 INFO L85 PathProgramCache]: Analyzing trace with hash 393714856, now seen corresponding path program 1 times [2025-01-10 02:27:10,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:10,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884700821] [2025-01-10 02:27:10,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:10,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:10,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-10 02:27:10,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-10 02:27:10,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:10,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:10,396 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:27:10,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:10,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884700821] [2025-01-10 02:27:10,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884700821] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:27:10,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:27:10,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:27:10,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39415002] [2025-01-10 02:27:10,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:27:10,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:27:10,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:10,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:27:10,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:27:10,398 INFO L87 Difference]: Start difference. First operand 354 states and 374 transitions. Second operand has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 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:27:10,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:10,694 INFO L93 Difference]: Finished difference Result 355 states and 374 transitions. [2025-01-10 02:27:10,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:27:10,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 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 70 [2025-01-10 02:27:10,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:10,696 INFO L225 Difference]: With dead ends: 355 [2025-01-10 02:27:10,696 INFO L226 Difference]: Without dead ends: 354 [2025-01-10 02:27:10,696 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:27:10,696 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 50 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:10,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 347 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:27:10,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-01-10 02:27:10,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2025-01-10 02:27:10,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 270 states have (on average 1.3444444444444446) internal successors, (363), 347 states have internal predecessors, (363), 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:27:10,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 373 transitions. [2025-01-10 02:27:10,706 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 373 transitions. Word has length 70 [2025-01-10 02:27:10,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:10,706 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 373 transitions. [2025-01-10 02:27:10,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 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:27:10,706 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 373 transitions. [2025-01-10 02:27:10,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-10 02:27:10,707 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:10,707 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:10,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 02:27:10,707 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-01-10 02:27:10,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:10,708 INFO L85 PathProgramCache]: Analyzing trace with hash -396367515, now seen corresponding path program 1 times [2025-01-10 02:27:10,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:10,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292357835] [2025-01-10 02:27:10,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:10,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:10,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-10 02:27:10,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-10 02:27:10,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:10,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:10,836 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:27:10,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:10,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292357835] [2025-01-10 02:27:10,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292357835] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:27:10,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392128066] [2025-01-10 02:27:10,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:10,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:10,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:27:10,840 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:27:10,841 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:27:10,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-10 02:27:10,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-10 02:27:10,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:10,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:10,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 02:27:10,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:27:10,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:27:10,986 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:27:10,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392128066] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:27:10,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:27:10,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-01-10 02:27:10,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657101940] [2025-01-10 02:27:10,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:27:10,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:27:10,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:10,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:27:10,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:27:10,988 INFO L87 Difference]: Start difference. First operand 354 states and 373 transitions. Second operand has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 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:27:11,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:11,035 INFO L93 Difference]: Finished difference Result 484 states and 508 transitions. [2025-01-10 02:27:11,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:27:11,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 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 73 [2025-01-10 02:27:11,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:11,037 INFO L225 Difference]: With dead ends: 484 [2025-01-10 02:27:11,037 INFO L226 Difference]: Without dead ends: 483 [2025-01-10 02:27:11,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-10 02:27:11,038 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 132 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:11,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 893 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:27:11,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2025-01-10 02:27:11,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 443. [2025-01-10 02:27:11,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 357 states have (on average 1.3529411764705883) internal successors, (483), 435 states have internal predecessors, (483), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 02:27:11,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 497 transitions. [2025-01-10 02:27:11,049 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 497 transitions. Word has length 73 [2025-01-10 02:27:11,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:11,049 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 497 transitions. [2025-01-10 02:27:11,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 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:27:11,050 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 497 transitions. [2025-01-10 02:27:11,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-10 02:27:11,051 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:11,051 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:27:11,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 02:27:11,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:11,251 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-01-10 02:27:11,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:11,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1198576240, now seen corresponding path program 1 times [2025-01-10 02:27:11,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:11,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474182442] [2025-01-10 02:27:11,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:11,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:11,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-10 02:27:11,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-10 02:27:11,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:11,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:27:11,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1564102718] [2025-01-10 02:27:11,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:11,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:11,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:27:11,277 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:27:11,283 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:27:11,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-10 02:27:11,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-10 02:27:11,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:11,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:11,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 02:27:11,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:27:11,693 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:27:11,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:27:11,986 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:27:11,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:11,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474182442] [2025-01-10 02:27:11,987 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:27:11,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564102718] [2025-01-10 02:27:11,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564102718] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:27:11,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:27:11,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-01-10 02:27:11,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703502429] [2025-01-10 02:27:11,987 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:27:11,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 02:27:11,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:11,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 02:27:11,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:27:11,988 INFO L87 Difference]: Start difference. First operand 443 states and 497 transitions. Second operand has 8 states, 7 states have (on average 30.857142857142858) internal successors, (216), 8 states have internal predecessors, (216), 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:27:13,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:13,888 INFO L93 Difference]: Finished difference Result 467 states and 515 transitions. [2025-01-10 02:27:13,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 02:27:13,889 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 30.857142857142858) internal successors, (216), 8 states have internal predecessors, (216), 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 113 [2025-01-10 02:27:13,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:13,894 INFO L225 Difference]: With dead ends: 467 [2025-01-10 02:27:13,894 INFO L226 Difference]: Without dead ends: 458 [2025-01-10 02:27:13,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-01-10 02:27:13,895 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 347 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:13,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 273 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-10 02:27:13,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-01-10 02:27:13,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 447. [2025-01-10 02:27:13,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 364 states have (on average 1.3186813186813187) internal successors, (480), 439 states have internal predecessors, (480), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 02:27:13,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 494 transitions. [2025-01-10 02:27:13,910 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 494 transitions. Word has length 113 [2025-01-10 02:27:13,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:13,911 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 494 transitions. [2025-01-10 02:27:13,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 30.857142857142858) internal successors, (216), 8 states have internal predecessors, (216), 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:27:13,911 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 494 transitions. [2025-01-10 02:27:13,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-10 02:27:13,912 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:13,912 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:27:13,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 02:27:14,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:14,117 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-01-10 02:27:14,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:14,117 INFO L85 PathProgramCache]: Analyzing trace with hash 780535570, now seen corresponding path program 1 times [2025-01-10 02:27:14,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:14,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243422749] [2025-01-10 02:27:14,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:14,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:14,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-10 02:27:14,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-10 02:27:14,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:14,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:27:14,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1317995761] [2025-01-10 02:27:14,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:14,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:14,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:27:14,150 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:27:14,167 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:27:14,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-10 02:27:14,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-10 02:27:14,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:14,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:14,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 02:27:14,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:27:14,611 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:27:14,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:27:15,031 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-10 02:27:15,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:15,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243422749] [2025-01-10 02:27:15,032 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:27:15,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317995761] [2025-01-10 02:27:15,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317995761] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 02:27:15,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:27:15,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-10 02:27:15,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719557077] [2025-01-10 02:27:15,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:27:15,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:27:15,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:15,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:27:15,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:27:15,035 INFO L87 Difference]: Start difference. First operand 447 states and 494 transitions. Second operand has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 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:27:25,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 10.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:27:38,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 8.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:27:41,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:41,032 INFO L93 Difference]: Finished difference Result 447 states and 494 transitions. [2025-01-10 02:27:41,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:27:41,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 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 115 [2025-01-10 02:27:41,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:41,035 INFO L225 Difference]: With dead ends: 447 [2025-01-10 02:27:41,035 INFO L226 Difference]: Without dead ends: 445 [2025-01-10 02:27:41,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:27:41,035 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 99 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:41,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 47 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 410 Invalid, 2 Unknown, 0 Unchecked, 26.0s Time] [2025-01-10 02:27:41,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2025-01-10 02:27:41,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2025-01-10 02:27:41,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 364 states have (on average 1.3021978021978022) internal successors, (474), 437 states have internal predecessors, (474), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 02:27:41,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 488 transitions. [2025-01-10 02:27:41,055 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 488 transitions. Word has length 115 [2025-01-10 02:27:41,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:41,056 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 488 transitions. [2025-01-10 02:27:41,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 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:27:41,057 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 488 transitions. [2025-01-10 02:27:41,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-10 02:27:41,058 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:41,058 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:41,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 02:27:41,259 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,SelfDestructingSolverStorable12 [2025-01-10 02:27:41,259 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-01-10 02:27:41,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:41,260 INFO L85 PathProgramCache]: Analyzing trace with hash -898102894, now seen corresponding path program 1 times [2025-01-10 02:27:41,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:41,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137988399] [2025-01-10 02:27:41,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:41,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:41,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-10 02:27:41,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-10 02:27:41,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:41,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:41,397 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:27:41,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:41,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137988399] [2025-01-10 02:27:41,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137988399] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:27:41,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101815974] [2025-01-10 02:27:41,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:41,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:41,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:27:41,401 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:27:41,402 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:27:41,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-10 02:27:41,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-10 02:27:41,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:41,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:41,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:27:41,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:27:41,534 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:27:41,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:27:41,633 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:27:41,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101815974] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:27:41,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:27:41,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 6 [2025-01-10 02:27:41,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946578090] [2025-01-10 02:27:41,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:27:41,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:27:41,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:41,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:27:41,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:27:41,635 INFO L87 Difference]: Start difference. First operand 445 states and 488 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 02:27:41,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:41,677 INFO L93 Difference]: Finished difference Result 457 states and 497 transitions. [2025-01-10 02:27:41,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:27:41,678 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 122 [2025-01-10 02:27:41,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:41,680 INFO L225 Difference]: With dead ends: 457 [2025-01-10 02:27:41,680 INFO L226 Difference]: Without dead ends: 406 [2025-01-10 02:27:41,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 240 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:27:41,681 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 5 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:41,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 737 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:27:41,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-01-10 02:27:41,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2025-01-10 02:27:41,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 325 states have (on average 1.3353846153846154) internal successors, (434), 397 states have internal predecessors, (434), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 02:27:41,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 446 transitions. [2025-01-10 02:27:41,693 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 446 transitions. Word has length 122 [2025-01-10 02:27:41,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:41,693 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 446 transitions. [2025-01-10 02:27:41,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 02:27:41,693 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 446 transitions. [2025-01-10 02:27:41,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-10 02:27:41,694 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:41,694 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:27:41,702 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:27:41,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-10 02:27:41,895 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-01-10 02:27:41,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:41,895 INFO L85 PathProgramCache]: Analyzing trace with hash -233434541, now seen corresponding path program 1 times [2025-01-10 02:27:41,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:41,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297124350] [2025-01-10 02:27:41,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:41,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:41,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-10 02:27:41,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-10 02:27:41,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:41,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:41,986 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:27:41,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:41,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297124350] [2025-01-10 02:27:41,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297124350] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:27:41,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466996552] [2025-01-10 02:27:41,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:41,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:41,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:27:41,988 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:27:41,991 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:27:42,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-10 02:27:42,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-10 02:27:42,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:42,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:42,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:27:42,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:27:42,168 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:27:42,168 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:27:42,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466996552] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:27:42,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:27:42,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 02:27:42,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543313637] [2025-01-10 02:27:42,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:27:42,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:27:42,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:42,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:27:42,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:27:42,170 INFO L87 Difference]: Start difference. First operand 406 states and 446 transitions. Second operand has 4 states, 3 states have (on average 38.666666666666664) internal successors, (116), 4 states have internal predecessors, (116), 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:27:42,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:42,199 INFO L93 Difference]: Finished difference Result 442 states and 452 transitions. [2025-01-10 02:27:42,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:27:42,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 38.666666666666664) internal successors, (116), 4 states have internal predecessors, (116), 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 123 [2025-01-10 02:27:42,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:42,201 INFO L225 Difference]: With dead ends: 442 [2025-01-10 02:27:42,201 INFO L226 Difference]: Without dead ends: 441 [2025-01-10 02:27:42,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 122 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:27:42,202 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 233 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:42,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 409 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:27:42,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-01-10 02:27:42,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 405. [2025-01-10 02:27:42,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 325 states have (on average 1.3292307692307692) internal successors, (432), 396 states have internal predecessors, (432), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 02:27:42,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 444 transitions. [2025-01-10 02:27:42,218 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 444 transitions. Word has length 123 [2025-01-10 02:27:42,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:42,219 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 444 transitions. [2025-01-10 02:27:42,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 38.666666666666664) internal successors, (116), 4 states have internal predecessors, (116), 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:27:42,219 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 444 transitions. [2025-01-10 02:27:42,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-10 02:27:42,220 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:42,220 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:27:42,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 02:27:42,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 02:27:42,424 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-01-10 02:27:42,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:42,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1353463968, now seen corresponding path program 1 times [2025-01-10 02:27:42,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:42,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026095942] [2025-01-10 02:27:42,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:42,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:42,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-10 02:27:42,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-10 02:27:42,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:42,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:42,540 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:27:42,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:42,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026095942] [2025-01-10 02:27:42,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026095942] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:27:42,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639348172] [2025-01-10 02:27:42,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:42,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:42,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:27:42,543 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:27:42,546 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:27:42,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-10 02:27:42,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-10 02:27:42,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:42,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:42,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:27:42,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:27:42,730 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:27:42,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:27:42,883 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:27:42,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639348172] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:27:42,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:27:42,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 02:27:42,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641877247] [2025-01-10 02:27:42,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:27:42,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:27:42,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:42,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:27:42,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:27:42,886 INFO L87 Difference]: Start difference. First operand 405 states and 444 transitions. Second operand has 7 states, 6 states have (on average 46.333333333333336) internal successors, (278), 7 states have internal predecessors, (278), 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:27:42,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:42,953 INFO L93 Difference]: Finished difference Result 751 states and 794 transitions. [2025-01-10 02:27:42,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:27:42,954 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 46.333333333333336) internal successors, (278), 7 states have internal predecessors, (278), 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 124 [2025-01-10 02:27:42,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:42,958 INFO L225 Difference]: With dead ends: 751 [2025-01-10 02:27:42,958 INFO L226 Difference]: Without dead ends: 750 [2025-01-10 02:27:42,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 244 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:27:42,959 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 240 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:42,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 1345 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:27:42,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2025-01-10 02:27:42,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 520. [2025-01-10 02:27:42,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 438 states have (on average 1.408675799086758) internal successors, (617), 509 states have internal predecessors, (617), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 02:27:42,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 633 transitions. [2025-01-10 02:27:42,981 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 633 transitions. Word has length 124 [2025-01-10 02:27:42,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:42,981 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 633 transitions. [2025-01-10 02:27:42,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 46.333333333333336) internal successors, (278), 7 states have internal predecessors, (278), 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:27:42,982 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 633 transitions. [2025-01-10 02:27:42,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-10 02:27:42,982 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:42,983 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:27:42,991 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:27:43,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:43,188 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-01-10 02:27:43,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:43,188 INFO L85 PathProgramCache]: Analyzing trace with hash 954527204, now seen corresponding path program 1 times [2025-01-10 02:27:43,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:43,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109740784] [2025-01-10 02:27:43,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:43,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:43,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-10 02:27:43,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-10 02:27:43,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:43,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:27:43,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [989832181] [2025-01-10 02:27:43,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:43,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:43,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:27:43,213 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:27:43,216 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:27:43,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-10 02:27:43,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-10 02:27:43,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:43,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:43,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 02:27:43,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:27:43,414 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:27:43,415 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:27:43,672 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:27:43,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:43,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109740784] [2025-01-10 02:27:43,673 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:27:43,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989832181] [2025-01-10 02:27:43,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989832181] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:27:43,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:27:43,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-01-10 02:27:43,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521741429] [2025-01-10 02:27:43,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:27:43,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 02:27:43,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:43,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 02:27:43,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:27:43,676 INFO L87 Difference]: Start difference. First operand 520 states and 633 transitions. Second operand has 8 states, 7 states have (on average 33.714285714285715) internal successors, (236), 8 states have internal predecessors, (236), 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:27:44,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:44,453 INFO L93 Difference]: Finished difference Result 655 states and 785 transitions. [2025-01-10 02:27:44,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:27:44,454 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 33.714285714285715) internal successors, (236), 8 states have internal predecessors, (236), 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) Word has length 128 [2025-01-10 02:27:44,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:44,457 INFO L225 Difference]: With dead ends: 655 [2025-01-10 02:27:44,457 INFO L226 Difference]: Without dead ends: 590 [2025-01-10 02:27:44,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:27:44,458 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 570 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:44,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 162 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-10 02:27:44,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2025-01-10 02:27:44,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 571. [2025-01-10 02:27:44,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 508 states have (on average 1.220472440944882) internal successors, (620), 561 states have internal predecessors, (620), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 02:27:44,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 634 transitions. [2025-01-10 02:27:44,477 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 634 transitions. Word has length 128 [2025-01-10 02:27:44,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:44,478 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 634 transitions. [2025-01-10 02:27:44,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 33.714285714285715) internal successors, (236), 8 states have internal predecessors, (236), 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:27:44,478 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 634 transitions. [2025-01-10 02:27:44,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-10 02:27:44,479 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:44,479 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 02:27:44,487 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:27:44,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 02:27:44,680 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-01-10 02:27:44,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:44,680 INFO L85 PathProgramCache]: Analyzing trace with hash 682940524, now seen corresponding path program 1 times [2025-01-10 02:27:44,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:44,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114244049] [2025-01-10 02:27:44,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:44,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:44,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-10 02:27:44,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-10 02:27:44,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:44,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:27:44,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [255083782] [2025-01-10 02:27:44,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:44,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:44,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:27:44,710 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:27:44,713 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:27:44,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-10 02:27:44,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-10 02:27:44,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:44,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:44,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 02:27:44,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:27:45,128 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:27:45,129 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:27:45,888 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:27:45,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:45,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114244049] [2025-01-10 02:27:45,889 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:27:45,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255083782] [2025-01-10 02:27:45,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255083782] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:27:45,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:27:45,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2025-01-10 02:27:45,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241835491] [2025-01-10 02:27:45,890 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:27:45,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 02:27:45,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:45,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 02:27:45,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2025-01-10 02:27:45,891 INFO L87 Difference]: Start difference. First operand 571 states and 634 transitions. Second operand has 11 states, 10 states have (on average 25.2) internal successors, (252), 11 states have internal predecessors, (252), 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:27:51,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:27:55,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:55,283 INFO L93 Difference]: Finished difference Result 581 states and 643 transitions. [2025-01-10 02:27:55,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 02:27:55,283 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 25.2) internal successors, (252), 11 states have internal predecessors, (252), 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) Word has length 136 [2025-01-10 02:27:55,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:55,285 INFO L225 Difference]: With dead ends: 581 [2025-01-10 02:27:55,285 INFO L226 Difference]: Without dead ends: 580 [2025-01-10 02:27:55,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2025-01-10 02:27:55,286 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 555 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 1491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:55,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 161 Invalid, 1491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1444 Invalid, 1 Unknown, 0 Unchecked, 9.3s Time] [2025-01-10 02:27:55,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-01-10 02:27:55,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 570. [2025-01-10 02:27:55,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 508 states have (on average 1.2145669291338583) internal successors, (617), 560 states have internal predecessors, (617), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 02:27:55,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 631 transitions. [2025-01-10 02:27:55,306 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 631 transitions. Word has length 136 [2025-01-10 02:27:55,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:55,307 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 631 transitions. [2025-01-10 02:27:55,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 25.2) internal successors, (252), 11 states have internal predecessors, (252), 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:27:55,307 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 631 transitions. [2025-01-10 02:27:55,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-10 02:27:55,308 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:55,308 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:27:55,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 02:27:55,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 02:27:55,513 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-01-10 02:27:55,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:55,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1565017631, now seen corresponding path program 1 times [2025-01-10 02:27:55,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:55,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039055700] [2025-01-10 02:27:55,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:55,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:55,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-10 02:27:55,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-10 02:27:55,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:55,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:27:55,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [548133936] [2025-01-10 02:27:55,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:55,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:55,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:27:55,542 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:27:55,543 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:27:55,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-10 02:27:55,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-10 02:27:55,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:55,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:55,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:27:55,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:27:56,005 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:27:56,006 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:27:56,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:56,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039055700] [2025-01-10 02:27:56,328 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:27:56,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548133936] [2025-01-10 02:27:56,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548133936] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:27:56,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:27:56,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-01-10 02:27:56,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751286580] [2025-01-10 02:27:56,329 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-10 02:27:56,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:27:56,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:56,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:27:56,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:27:56,330 INFO L87 Difference]: Start difference. First operand 570 states and 631 transitions. Second operand has 5 states, 4 states have (on average 39.5) internal successors, (158), 5 states have internal predecessors, (158), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 02:27:56,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:56,725 INFO L93 Difference]: Finished difference Result 573 states and 634 transitions. [2025-01-10 02:27:56,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:27:56,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 39.5) internal successors, (158), 5 states have internal predecessors, (158), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 170 [2025-01-10 02:27:56,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:56,727 INFO L225 Difference]: With dead ends: 573 [2025-01-10 02:27:56,727 INFO L226 Difference]: Without dead ends: 560 [2025-01-10 02:27:56,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:27:56,728 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 70 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:56,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 75 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 02:27:56,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-01-10 02:27:56,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 557. [2025-01-10 02:27:56,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 508 states have (on average 1.1653543307086613) internal successors, (592), 547 states have internal predecessors, (592), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 02:27:56,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 606 transitions. [2025-01-10 02:27:56,748 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 606 transitions. Word has length 170 [2025-01-10 02:27:56,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:56,749 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 606 transitions. [2025-01-10 02:27:56,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 39.5) internal successors, (158), 5 states have internal predecessors, (158), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 02:27:56,749 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 606 transitions. [2025-01-10 02:27:56,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-10 02:27:56,751 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:56,752 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:27:56,760 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:27:56,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:56,952 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-01-10 02:27:56,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:56,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1270906568, now seen corresponding path program 1 times [2025-01-10 02:27:56,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:56,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421460963] [2025-01-10 02:27:56,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:56,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:56,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-10 02:27:56,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-10 02:27:56,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:56,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:27:56,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1738281013] [2025-01-10 02:27:56,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:56,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:56,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:27:56,985 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:27:56,987 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:27:57,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-10 02:27:57,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-10 02:27:57,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:57,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:57,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 02:27:57,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:27:57,477 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:27:57,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:27:57,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:57,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421460963] [2025-01-10 02:27:57,886 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:27:57,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738281013] [2025-01-10 02:27:57,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738281013] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:27:57,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:27:57,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-01-10 02:27:57,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71017105] [2025-01-10 02:27:57,886 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-10 02:27:57,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:27:57,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:57,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:27:57,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:27:57,888 INFO L87 Difference]: Start difference. First operand 557 states and 606 transitions. Second operand has 6 states, 5 states have (on average 31.8) internal successors, (159), 6 states have internal predecessors, (159), 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:27:58,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:58,307 INFO L93 Difference]: Finished difference Result 561 states and 610 transitions. [2025-01-10 02:27:58,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:27:58,308 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 31.8) internal successors, (159), 6 states have internal predecessors, (159), 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 171 [2025-01-10 02:27:58,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:58,310 INFO L225 Difference]: With dead ends: 561 [2025-01-10 02:27:58,310 INFO L226 Difference]: Without dead ends: 515 [2025-01-10 02:27:58,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:27:58,311 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 2 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:58,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 156 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 02:27:58,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-01-10 02:27:58,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2025-01-10 02:27:58,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 466 states have (on average 1.1781115879828326) internal successors, (549), 505 states have internal predecessors, (549), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 02:27:58,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 563 transitions. [2025-01-10 02:27:58,329 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 563 transitions. Word has length 171 [2025-01-10 02:27:58,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:58,330 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 563 transitions. [2025-01-10 02:27:58,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 31.8) internal successors, (159), 6 states have internal predecessors, (159), 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:27:58,330 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 563 transitions. [2025-01-10 02:27:58,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-10 02:27:58,331 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:58,332 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 02:27:58,340 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:27:58,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:58,532 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-01-10 02:27:58,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:58,533 INFO L85 PathProgramCache]: Analyzing trace with hash 5186009, now seen corresponding path program 1 times [2025-01-10 02:27:58,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:58,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703258649] [2025-01-10 02:27:58,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:58,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:58,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-10 02:27:58,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-10 02:27:58,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:58,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:58,676 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 148 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:27:58,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:58,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703258649] [2025-01-10 02:27:58,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703258649] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:27:58,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467413919] [2025-01-10 02:27:58,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:58,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:58,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:27:58,679 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:27:58,682 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:27:58,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-10 02:27:58,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-10 02:27:58,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:58,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:58,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 02:27:58,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:27:58,887 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 152 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:27:58,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:27:59,055 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 148 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:27:59,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467413919] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:27:59,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:27:59,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 8 [2025-01-10 02:27:59,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527175101] [2025-01-10 02:27:59,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:27:59,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 02:27:59,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:59,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 02:27:59,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:27:59,057 INFO L87 Difference]: Start difference. First operand 515 states and 563 transitions. Second operand has 8 states, 8 states have (on average 22.375) internal successors, (179), 8 states have internal predecessors, (179), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 02:27:59,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:59,126 INFO L93 Difference]: Finished difference Result 534 states and 580 transitions. [2025-01-10 02:27:59,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 02:27:59,127 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.375) internal successors, (179), 8 states have internal predecessors, (179), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 180 [2025-01-10 02:27:59,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:59,128 INFO L225 Difference]: With dead ends: 534 [2025-01-10 02:27:59,128 INFO L226 Difference]: Without dead ends: 192 [2025-01-10 02:27:59,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 355 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2025-01-10 02:27:59,129 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 104 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:59,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 764 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:27:59,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-01-10 02:27:59,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2025-01-10 02:27:59,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 183 states have (on average 1.010928961748634) internal successors, (185), 185 states have internal predecessors, (185), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:27:59,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 191 transitions. [2025-01-10 02:27:59,137 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 191 transitions. Word has length 180 [2025-01-10 02:27:59,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:59,149 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 191 transitions. [2025-01-10 02:27:59,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.375) internal successors, (179), 8 states have internal predecessors, (179), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 02:27:59,149 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 191 transitions. [2025-01-10 02:27:59,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-10 02:27:59,151 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:59,151 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:27:59,159 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:27:59,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:59,352 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-01-10 02:27:59,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:59,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1641100891, now seen corresponding path program 1 times [2025-01-10 02:27:59,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:59,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469950771] [2025-01-10 02:27:59,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:59,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:59,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-10 02:27:59,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-10 02:27:59,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:59,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:27:59,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1926937912] [2025-01-10 02:27:59,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:59,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:59,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:27:59,375 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:27:59,377 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:27:59,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-10 02:27:59,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-10 02:27:59,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:59,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:59,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 02:27:59,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:27:59,869 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 3 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 02:27:59,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:28:08,078 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (forall ((|v_ULTIMATE.start_main_~y~0#1_235| Int)) (or (< (* |v_ULTIMATE.start_main_~y~0#1_235| |v_ULTIMATE.start_main_~y~0#1_235| |v_ULTIMATE.start_main_~y~0#1_235| |v_ULTIMATE.start_main_~y~0#1_235| |v_ULTIMATE.start_main_~y~0#1_235|) (+ 768614336404564651 (div (+ .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| (- 5)) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| (- 6)) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| (- 2))) 12))) (< (+ |c_ULTIMATE.start_main_~y~0#1| 1) |v_ULTIMATE.start_main_~y~0#1_235|))) (not (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 7) .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))))) is different from false [2025-01-10 02:28:08,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:28:08,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469950771] [2025-01-10 02:28:08,094 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:28:08,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926937912] [2025-01-10 02:28:08,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926937912] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:28:08,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:28:08,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-01-10 02:28:08,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791272026] [2025-01-10 02:28:08,095 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-10 02:28:08,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 02:28:08,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:28:08,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 02:28:08,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=100, Unknown=1, NotChecked=20, Total=156 [2025-01-10 02:28:08,096 INFO L87 Difference]: Start difference. First operand 192 states and 191 transitions. Second operand has 9 states, 8 states have (on average 22.0) internal successors, (176), 9 states have internal predecessors, (176), 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:28:08,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:28:08,592 INFO L93 Difference]: Finished difference Result 192 states and 191 transitions. [2025-01-10 02:28:08,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 02:28:08,593 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 22.0) internal successors, (176), 9 states have internal predecessors, (176), 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 180 [2025-01-10 02:28:08,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:28:08,594 INFO L225 Difference]: With dead ends: 192 [2025-01-10 02:28:08,594 INFO L226 Difference]: Without dead ends: 190 [2025-01-10 02:28:08,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=50, Invalid=135, Unknown=1, NotChecked=24, Total=210 [2025-01-10 02:28:08,595 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 62 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 02:28:08,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 262 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 02:28:08,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-01-10 02:28:08,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2025-01-10 02:28:08,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 183 states have (on average 1.0) internal successors, (183), 183 states have internal predecessors, (183), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:28:08,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 189 transitions. [2025-01-10 02:28:08,604 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 189 transitions. Word has length 180 [2025-01-10 02:28:08,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:28:08,604 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 189 transitions. [2025-01-10 02:28:08,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 22.0) internal successors, (176), 9 states have internal predecessors, (176), 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:28:08,605 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 189 transitions. [2025-01-10 02:28:08,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-01-10 02:28:08,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:28:08,606 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:28:08,615 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:28:08,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:28:08,807 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2025-01-10 02:28:08,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:28:08,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1834499983, now seen corresponding path program 1 times [2025-01-10 02:28:08,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:28:08,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192289397] [2025-01-10 02:28:08,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:28:08,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:28:08,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-01-10 02:28:08,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-01-10 02:28:08,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:28:08,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:28:08,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1449295056] [2025-01-10 02:28:08,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:28:08,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:28:08,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:28:08,850 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:28:08,853 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:28:08,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-01-10 02:28:08,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-01-10 02:28:08,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:28:08,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:28:08,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 02:28:08,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:28:09,384 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:28:09,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:28:10,262 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:28:10,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:28:10,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192289397] [2025-01-10 02:28:10,262 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:28:10,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449295056] [2025-01-10 02:28:10,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449295056] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:28:10,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:28:10,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-01-10 02:28:10,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640379142] [2025-01-10 02:28:10,263 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:28:10,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 02:28:10,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:28:10,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 02:28:10,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-01-10 02:28:10,264 INFO L87 Difference]: Start difference. First operand 190 states and 189 transitions. Second operand has 12 states, 11 states have (on average 31.818181818181817) internal successors, (350), 12 states have internal predecessors, (350), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 02:28:10,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:28:10,527 INFO L93 Difference]: Finished difference Result 190 states and 189 transitions. [2025-01-10 02:28:10,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:28:10,528 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 31.818181818181817) internal successors, (350), 12 states have internal predecessors, (350), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 189 [2025-01-10 02:28:10,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:28:10,528 INFO L225 Difference]: With dead ends: 190 [2025-01-10 02:28:10,528 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 02:28:10,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-01-10 02:28:10,529 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:28:10,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:28:10,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 02:28:10,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 02:28:10,530 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:28:10,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 02:28:10,530 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 189 [2025-01-10 02:28:10,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:28:10,530 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 02:28:10,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 31.818181818181817) internal successors, (350), 12 states have internal predecessors, (350), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 02:28:10,531 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 02:28:10,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 02:28:10,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 104 remaining) [2025-01-10 02:28:10,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 104 remaining) [2025-01-10 02:28:10,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 104 remaining) [2025-01-10 02:28:10,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 104 remaining) [2025-01-10 02:28:10,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 104 remaining) [2025-01-10 02:28:10,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 104 remaining) [2025-01-10 02:28:10,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 104 remaining) [2025-01-10 02:28:10,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 104 remaining) [2025-01-10 02:28:10,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 104 remaining) [2025-01-10 02:28:10,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 104 remaining) [2025-01-10 02:28:10,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 104 remaining) [2025-01-10 02:28:10,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 104 remaining) [2025-01-10 02:28:10,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 104 remaining) [2025-01-10 02:28:10,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 104 remaining) [2025-01-10 02:28:10,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 104 remaining) [2025-01-10 02:28:10,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 104 remaining) [2025-01-10 02:28:10,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 104 remaining) [2025-01-10 02:28:10,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 104 remaining) [2025-01-10 02:28:10,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 104 remaining) [2025-01-10 02:28:10,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 104 remaining) [2025-01-10 02:28:10,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 104 remaining) [2025-01-10 02:28:10,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 104 remaining) [2025-01-10 02:28:10,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 104 remaining) [2025-01-10 02:28:10,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 104 remaining) [2025-01-10 02:28:10,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 104 remaining) [2025-01-10 02:28:10,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 104 remaining) [2025-01-10 02:28:10,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 104 remaining) [2025-01-10 02:28:10,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 104 remaining) [2025-01-10 02:28:10,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 104 remaining) [2025-01-10 02:28:10,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 104 remaining) [2025-01-10 02:28:10,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 104 remaining) [2025-01-10 02:28:10,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 104 remaining) [2025-01-10 02:28:10,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 104 remaining) [2025-01-10 02:28:10,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 104 remaining) [2025-01-10 02:28:10,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 104 remaining) [2025-01-10 02:28:10,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 104 remaining) [2025-01-10 02:28:10,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 104 remaining) [2025-01-10 02:28:10,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 104 remaining) [2025-01-10 02:28:10,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 104 remaining) [2025-01-10 02:28:10,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 104 remaining) [2025-01-10 02:28:10,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 104 remaining) [2025-01-10 02:28:10,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 104 remaining) [2025-01-10 02:28:10,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 104 remaining) [2025-01-10 02:28:10,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 104 remaining) [2025-01-10 02:28:10,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 104 remaining) [2025-01-10 02:28:10,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 104 remaining) [2025-01-10 02:28:10,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 104 remaining) [2025-01-10 02:28:10,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 104 remaining) [2025-01-10 02:28:10,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 104 remaining) [2025-01-10 02:28:10,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 104 remaining) [2025-01-10 02:28:10,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 104 remaining) [2025-01-10 02:28:10,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 104 remaining) [2025-01-10 02:28:10,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 104 remaining) [2025-01-10 02:28:10,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 104 remaining) [2025-01-10 02:28:10,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 104 remaining) [2025-01-10 02:28:10,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 104 remaining) [2025-01-10 02:28:10,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 104 remaining) [2025-01-10 02:28:10,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 104 remaining) [2025-01-10 02:28:10,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 104 remaining) [2025-01-10 02:28:10,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 104 remaining) [2025-01-10 02:28:10,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 104 remaining) [2025-01-10 02:28:10,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 104 remaining) [2025-01-10 02:28:10,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 104 remaining) [2025-01-10 02:28:10,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 104 remaining) [2025-01-10 02:28:10,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 104 remaining) [2025-01-10 02:28:10,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 104 remaining) [2025-01-10 02:28:10,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 104 remaining) [2025-01-10 02:28:10,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 104 remaining) [2025-01-10 02:28:10,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 104 remaining) [2025-01-10 02:28:10,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 104 remaining) [2025-01-10 02:28:10,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 104 remaining) [2025-01-10 02:28:10,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 104 remaining) [2025-01-10 02:28:10,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 104 remaining) [2025-01-10 02:28:10,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 104 remaining) [2025-01-10 02:28:10,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 104 remaining) [2025-01-10 02:28:10,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 104 remaining) [2025-01-10 02:28:10,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 104 remaining) [2025-01-10 02:28:10,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 104 remaining) [2025-01-10 02:28:10,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 104 remaining) [2025-01-10 02:28:10,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 104 remaining) [2025-01-10 02:28:10,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 104 remaining) [2025-01-10 02:28:10,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 104 remaining) [2025-01-10 02:28:10,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 104 remaining) [2025-01-10 02:28:10,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 104 remaining) [2025-01-10 02:28:10,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 104 remaining) [2025-01-10 02:28:10,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 104 remaining) [2025-01-10 02:28:10,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 104 remaining) [2025-01-10 02:28:10,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 104 remaining) [2025-01-10 02:28:10,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 104 remaining) [2025-01-10 02:28:10,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 104 remaining) [2025-01-10 02:28:10,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 104 remaining) [2025-01-10 02:28:10,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 104 remaining) [2025-01-10 02:28:10,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 104 remaining) [2025-01-10 02:28:10,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 104 remaining) [2025-01-10 02:28:10,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 104 remaining) [2025-01-10 02:28:10,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 104 remaining) [2025-01-10 02:28:10,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 104 remaining) [2025-01-10 02:28:10,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 104 remaining) [2025-01-10 02:28:10,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 104 remaining) [2025-01-10 02:28:10,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr99ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 104 remaining) [2025-01-10 02:28:10,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 104 remaining) [2025-01-10 02:28:10,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 104 remaining) [2025-01-10 02:28:10,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr102ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 104 remaining) [2025-01-10 02:28:10,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr103ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 104 remaining) [2025-01-10 02:28:10,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-01-10 02:28:10,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-10 02:28:10,745 INFO L422 BasicCegarLoop]: Path program 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:28:10,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 02:28:11,032 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 02:28:11,043 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-01-10 02:28:11,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:28:11 BoogieIcfgContainer [2025-01-10 02:28:11,052 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 02:28:11,052 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 02:28:11,053 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 02:28:11,053 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 02:28:11,053 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:27:07" (3/4) ... [2025-01-10 02:28:11,055 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 02:28:11,060 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-01-10 02:28:11,068 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-10 02:28:11,068 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 02:28:11,068 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 02:28:11,069 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 02:28:11,153 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 02:28:11,153 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 02:28:11,154 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 02:28:11,155 INFO L158 Benchmark]: Toolchain (without parser) took 64791.16ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 105.5MB in the beginning and 254.7MB in the end (delta: -149.3MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2025-01-10 02:28:11,158 INFO L158 Benchmark]: CDTParser took 0.75ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:28:11,158 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.78ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 94.0MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:28:11,158 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.66ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 91.5MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:28:11,158 INFO L158 Benchmark]: Boogie Preprocessor took 41.30ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 90.5MB in the end (delta: 978.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:28:11,158 INFO L158 Benchmark]: RCFGBuilder took 636.43ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 57.9MB in the end (delta: 32.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-10 02:28:11,158 INFO L158 Benchmark]: TraceAbstraction took 63735.63ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 56.9MB in the beginning and 259.5MB in the end (delta: -202.6MB). Peak memory consumption was 129.1MB. Max. memory is 16.1GB. [2025-01-10 02:28:11,158 INFO L158 Benchmark]: Witness Printer took 101.11ms. Allocated memory is still 318.8MB. Free memory was 259.5MB in the beginning and 254.7MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:28:11,159 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.75ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.78ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 94.0MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.66ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 91.5MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.30ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 90.5MB in the end (delta: 978.3kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 636.43ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 57.9MB in the end (delta: 32.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 63735.63ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 56.9MB in the beginning and 259.5MB in the end (delta: -202.6MB). Peak memory consumption was 129.1MB. Max. memory is 16.1GB. * Witness Printer took 101.11ms. Allocated memory is still 318.8MB. Free memory was 259.5MB in the beginning and 254.7MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: 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: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: 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, 228 locations, 104 error locations. Started 1 CEGAR loops. OverallTime: 63.4s, OverallIterations: 23, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 41.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 3175 SdHoareTripleChecker+Valid, 40.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3158 mSDsluCounter, 8567 SdHoareTripleChecker+Invalid, 39.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5451 mSDsCounter, 320 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7968 IncrementalHoareTripleChecker+Invalid, 8291 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 320 mSolverCounterUnsat, 3116 mSDtfsCounter, 7968 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3270 GetRequests, 3135 SyntacticMatches, 10 SemanticMatches, 125 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=571occurred in iteration=17, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 398 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 16.8s InterpolantComputationTime, 4092 NumberOfCodeBlocks, 4092 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 3899 ConstructedInterpolants, 44 QuantifiedInterpolants, 26190 SizeOfPredicates, 12 NumberOfNonLiveVariables, 2638 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 36 InterpolantComputations, 13 PerfectInterpolantSequences, 653/1542 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 104 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ((((((((c == 1) && (x == 1)) && (y == 1)) && (1 <= k)) && (k <= 256)) && (counter == 1)) || (((((c == 0) && (y == 0)) && (counter == 0)) && (k <= 256)) && (x == 0))) || (((((((0 <= ((__int128) x + 768614336404564617)) && (1 <= c)) && (2 == y)) && (c <= 9223372036854775805)) && (1 <= k)) && (k <= 256)) && (counter == 2))) RESULT: Ultimate proved your program to be correct! [2025-01-10 02:28:11,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE