./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound10.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/ps5-ll_valuebound10.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 4cd3813e1162515d6dfe6f021a67e8bd41b689ea28e27900ea441d7fd3bbe5cc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:26:05,083 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:26:05,135 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:26:05,140 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:26:05,140 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:26:05,162 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:26:05,167 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:26:05,167 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:26:05,167 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:26:05,167 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:26:05,167 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:26:05,167 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:26:05,168 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:26:05,168 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:26:05,168 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:26:05,168 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:26:05,168 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:26:05,168 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:26:05,168 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:26:05,168 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:26:05,168 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:26:05,168 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:26:05,168 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:26:05,168 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:26:05,168 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:26:05,168 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:26:05,168 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:26:05,168 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:26:05,168 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:26:05,168 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:26:05,168 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:26:05,169 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:26:05,169 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:26:05,169 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:26:05,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:26:05,169 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:26:05,169 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:26:05,169 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:26:05,169 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:26:05,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:26:05,170 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:26:05,170 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:26:05,170 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:26:05,170 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:26:05,170 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:26:05,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:26:05,170 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:26:05,170 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:26:05,170 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:26:05,170 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:26:05,171 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 -> 4cd3813e1162515d6dfe6f021a67e8bd41b689ea28e27900ea441d7fd3bbe5cc [2025-01-10 02:26:05,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:26:05,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:26:05,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:26:05,418 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:26:05,418 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:26:05,419 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound10.c [2025-01-10 02:26:06,547 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b3e707c93/4c6486ff61844bccb3c2bd97d6c1bb05/FLAGd84aa5892 [2025-01-10 02:26:06,825 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:26:06,825 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound10.c [2025-01-10 02:26:06,832 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b3e707c93/4c6486ff61844bccb3c2bd97d6c1bb05/FLAGd84aa5892 [2025-01-10 02:26:07,141 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b3e707c93/4c6486ff61844bccb3c2bd97d6c1bb05 [2025-01-10 02:26:07,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:26:07,144 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:26:07,145 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:26:07,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:26:07,148 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:26:07,149 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:26:07" (1/1) ... [2025-01-10 02:26:07,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bafcea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:26:07, skipping insertion in model container [2025-01-10 02:26:07,150 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:26:07" (1/1) ... [2025-01-10 02:26:07,160 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:26:07,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:26:07,263 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:26:07,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:26:07,290 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:26:07,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:26:07 WrapperNode [2025-01-10 02:26:07,292 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:26:07,293 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:26:07,294 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:26:07,294 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:26:07,298 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:26:07" (1/1) ... [2025-01-10 02:26:07,303 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:26:07" (1/1) ... [2025-01-10 02:26:07,327 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 123 [2025-01-10 02:26:07,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:26:07,332 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:26:07,332 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:26:07,332 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:26:07,339 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:26:07" (1/1) ... [2025-01-10 02:26:07,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:26:07" (1/1) ... [2025-01-10 02:26:07,340 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:26:07" (1/1) ... [2025-01-10 02:26:07,351 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:26:07,353 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:26:07" (1/1) ... [2025-01-10 02:26:07,353 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:26:07" (1/1) ... [2025-01-10 02:26:07,357 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:26:07" (1/1) ... [2025-01-10 02:26:07,358 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:26:07" (1/1) ... [2025-01-10 02:26:07,363 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:26:07" (1/1) ... [2025-01-10 02:26:07,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:26:07" (1/1) ... [2025-01-10 02:26:07,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:26:07" (1/1) ... [2025-01-10 02:26:07,369 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:26:07,370 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:26:07,370 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:26:07,370 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:26:07,370 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:26:07" (1/1) ... [2025-01-10 02:26:07,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:26:07,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:26:07,400 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:26:07,406 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:26:07,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:26:07,430 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 02:26:07,430 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 02:26:07,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:26:07,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:26:07,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:26:07,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 02:26:07,430 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 02:26:07,478 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:26:07,479 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:26:07,845 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2025-01-10 02:26:07,845 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:26:07,858 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:26:07,858 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 02:26:07,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:26:07 BoogieIcfgContainer [2025-01-10 02:26:07,858 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:26:07,860 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:26:07,860 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:26:07,863 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:26:07,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:26:07" (1/3) ... [2025-01-10 02:26:07,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40089df9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:26:07, skipping insertion in model container [2025-01-10 02:26:07,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:26:07" (2/3) ... [2025-01-10 02:26:07,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40089df9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:26:07, skipping insertion in model container [2025-01-10 02:26:07,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:26:07" (3/3) ... [2025-01-10 02:26:07,865 INFO L128 eAbstractionObserver]: Analyzing ICFG ps5-ll_valuebound10.c [2025-01-10 02:26:07,875 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:26:07,876 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ps5-ll_valuebound10.c that has 3 procedures, 191 locations, 1 initial locations, 1 loop locations, and 84 error locations. [2025-01-10 02:26:07,919 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:26:07,926 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;@12e817e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:26:07,926 INFO L334 AbstractCegarLoop]: Starting to check reachability of 84 error locations. [2025-01-10 02:26:07,929 INFO L276 IsEmpty]: Start isEmpty. Operand has 191 states, 99 states have (on average 1.8888888888888888) internal successors, (187), 183 states have internal predecessors, (187), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:26:07,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 02:26:07,932 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:26:07,933 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:26:07,933 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-01-10 02:26:07,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:26:07,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1875654389, now seen corresponding path program 1 times [2025-01-10 02:26:07,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:26:07,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641381337] [2025-01-10 02:26:07,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:07,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:26:07,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 02:26:07,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 02:26:07,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:07,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:26:08,023 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 02:26:08,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:26:08,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641381337] [2025-01-10 02:26:08,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641381337] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:26:08,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982157917] [2025-01-10 02:26:08,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:08,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:26:08,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:26:08,026 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:26:08,027 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:26:08,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 02:26:08,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 02:26:08,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:08,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:26:08,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-10 02:26:08,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:26:08,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 02:26:08,071 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:26:08,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982157917] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:26:08,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:26:08,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-10 02:26:08,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285871292] [2025-01-10 02:26:08,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:26:08,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 02:26:08,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:26:08,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 02:26:08,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 02:26:08,093 INFO L87 Difference]: Start difference. First operand has 191 states, 99 states have (on average 1.8888888888888888) internal successors, (187), 183 states have internal predecessors, (187), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:26:08,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:26:08,111 INFO L93 Difference]: Finished difference Result 365 states and 394 transitions. [2025-01-10 02:26:08,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 02:26:08,112 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2025-01-10 02:26:08,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:26:08,116 INFO L225 Difference]: With dead ends: 365 [2025-01-10 02:26:08,116 INFO L226 Difference]: Without dead ends: 171 [2025-01-10 02:26:08,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 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:26:08,120 INFO L435 NwaCegarLoop]: 180 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, 180 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:26:08,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:26:08,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-01-10 02:26:08,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2025-01-10 02:26:08,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 94 states have (on average 1.7553191489361701) internal successors, (165), 164 states have internal predecessors, (165), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:26:08,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2025-01-10 02:26:08,150 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 14 [2025-01-10 02:26:08,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:26:08,150 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2025-01-10 02:26:08,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:26:08,150 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2025-01-10 02:26:08,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 02:26:08,151 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:26:08,151 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:26:08,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 02:26:08,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-10 02:26:08,356 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-01-10 02:26:08,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:26:08,357 INFO L85 PathProgramCache]: Analyzing trace with hash 2028132939, now seen corresponding path program 1 times [2025-01-10 02:26:08,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:26:08,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902369995] [2025-01-10 02:26:08,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:08,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:26:08,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 02:26:08,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 02:26:08,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:08,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:26:08,410 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:26:08,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:26:08,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902369995] [2025-01-10 02:26:08,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902369995] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:26:08,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:26:08,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:26:08,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958849674] [2025-01-10 02:26:08,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:26:08,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:26:08,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:26:08,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:26:08,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:26:08,411 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:26:08,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:26:08,734 INFO L93 Difference]: Finished difference Result 307 states and 319 transitions. [2025-01-10 02:26:08,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:26:08,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2025-01-10 02:26:08,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:26:08,735 INFO L225 Difference]: With dead ends: 307 [2025-01-10 02:26:08,737 INFO L226 Difference]: Without dead ends: 251 [2025-01-10 02:26:08,738 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:26:08,738 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 82 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:26:08,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 125 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:26:08,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-01-10 02:26:08,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 245. [2025-01-10 02:26:08,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 167 states have (on average 1.5089820359281436) internal successors, (252), 237 states have internal predecessors, (252), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:26:08,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 262 transitions. [2025-01-10 02:26:08,789 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 262 transitions. Word has length 14 [2025-01-10 02:26:08,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:26:08,790 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 262 transitions. [2025-01-10 02:26:08,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:26:08,791 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 262 transitions. [2025-01-10 02:26:08,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-10 02:26:08,791 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:26:08,791 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:26:08,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 02:26:08,791 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-01-10 02:26:08,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:26:08,792 INFO L85 PathProgramCache]: Analyzing trace with hash -142967449, now seen corresponding path program 1 times [2025-01-10 02:26:08,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:26:08,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104631882] [2025-01-10 02:26:08,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:08,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:26:08,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 02:26:08,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 02:26:08,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:08,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:26:08,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:26:08,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:26:08,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104631882] [2025-01-10 02:26:08,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104631882] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:26:08,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:26:08,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:26:08,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760322394] [2025-01-10 02:26:08,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:26:08,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:26:08,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:26:08,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:26:08,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:26:08,867 INFO L87 Difference]: Start difference. First operand 245 states and 262 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:26:08,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:26:08,933 INFO L93 Difference]: Finished difference Result 264 states and 276 transitions. [2025-01-10 02:26:08,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:26:08,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2025-01-10 02:26:08,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:26:08,935 INFO L225 Difference]: With dead ends: 264 [2025-01-10 02:26:08,935 INFO L226 Difference]: Without dead ends: 259 [2025-01-10 02:26:08,935 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:26:08,935 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 58 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:26:08,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 294 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:26:08,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-01-10 02:26:08,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 252. [2025-01-10 02:26:08,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 174 states have (on average 1.4885057471264367) internal successors, (259), 244 states have internal predecessors, (259), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:26:08,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 269 transitions. [2025-01-10 02:26:08,944 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 269 transitions. Word has length 42 [2025-01-10 02:26:08,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:26:08,944 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 269 transitions. [2025-01-10 02:26:08,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:26:08,944 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 269 transitions. [2025-01-10 02:26:08,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-10 02:26:08,945 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:26:08,945 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:26:08,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 02:26:08,945 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-01-10 02:26:08,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:26:08,946 INFO L85 PathProgramCache]: Analyzing trace with hash 47238121, now seen corresponding path program 1 times [2025-01-10 02:26:08,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:26:08,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245377502] [2025-01-10 02:26:08,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:08,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:26:08,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 02:26:08,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 02:26:08,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:08,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:26:09,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:26:09,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:26:09,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245377502] [2025-01-10 02:26:09,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245377502] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:26:09,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:26:09,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:26:09,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569761416] [2025-01-10 02:26:09,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:26:09,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:26:09,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:26:09,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:26:09,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:26:09,060 INFO L87 Difference]: Start difference. First operand 252 states and 269 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:26:09,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:26:09,194 INFO L93 Difference]: Finished difference Result 263 states and 271 transitions. [2025-01-10 02:26:09,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:26:09,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2025-01-10 02:26:09,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:26:09,196 INFO L225 Difference]: With dead ends: 263 [2025-01-10 02:26:09,196 INFO L226 Difference]: Without dead ends: 258 [2025-01-10 02:26:09,196 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:26:09,196 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 132 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:26:09,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 231 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:26:09,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-01-10 02:26:09,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 252. [2025-01-10 02:26:09,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 174 states have (on average 1.4597701149425288) internal successors, (254), 244 states have internal predecessors, (254), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:26:09,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 264 transitions. [2025-01-10 02:26:09,213 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 264 transitions. Word has length 44 [2025-01-10 02:26:09,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:26:09,213 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 264 transitions. [2025-01-10 02:26:09,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:26:09,213 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 264 transitions. [2025-01-10 02:26:09,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-10 02:26:09,214 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:26:09,214 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:26:09,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 02:26:09,214 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-01-10 02:26:09,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:26:09,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1464381853, now seen corresponding path program 1 times [2025-01-10 02:26:09,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:26:09,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837671838] [2025-01-10 02:26:09,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:09,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:26:09,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-10 02:26:09,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 02:26:09,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:09,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:26:09,296 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:26:09,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:26:09,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837671838] [2025-01-10 02:26:09,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837671838] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:26:09,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:26:09,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:26:09,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759875245] [2025-01-10 02:26:09,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:26:09,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:26:09,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:26:09,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:26:09,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:26:09,297 INFO L87 Difference]: Start difference. First operand 252 states and 264 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:26:09,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:26:09,617 INFO L93 Difference]: Finished difference Result 262 states and 266 transitions. [2025-01-10 02:26:09,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:26:09,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2025-01-10 02:26:09,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:26:09,619 INFO L225 Difference]: With dead ends: 262 [2025-01-10 02:26:09,619 INFO L226 Difference]: Without dead ends: 224 [2025-01-10 02:26:09,619 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:26:09,619 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 81 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:26:09,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 265 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:26:09,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-01-10 02:26:09,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 218. [2025-01-10 02:26:09,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 140 states have (on average 1.542857142857143) internal successors, (216), 210 states have internal predecessors, (216), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:26:09,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 226 transitions. [2025-01-10 02:26:09,625 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 226 transitions. Word has length 45 [2025-01-10 02:26:09,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:26:09,626 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 226 transitions. [2025-01-10 02:26:09,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:26:09,626 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 226 transitions. [2025-01-10 02:26:09,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-10 02:26:09,626 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:26:09,626 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:26:09,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 02:26:09,626 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-01-10 02:26:09,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:26:09,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1672267992, now seen corresponding path program 1 times [2025-01-10 02:26:09,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:26:09,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766264779] [2025-01-10 02:26:09,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:09,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:26:09,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-10 02:26:09,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-10 02:26:09,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:09,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:26:09,686 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:26:09,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:26:09,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766264779] [2025-01-10 02:26:09,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766264779] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:26:09,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:26:09,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:26:09,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831082378] [2025-01-10 02:26:09,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:26:09,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:26:09,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:26:09,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:26:09,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:26:09,687 INFO L87 Difference]: Start difference. First operand 218 states and 226 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 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:26:09,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:26:09,699 INFO L93 Difference]: Finished difference Result 220 states and 226 transitions. [2025-01-10 02:26:09,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:26:09,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 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 54 [2025-01-10 02:26:09,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:26:09,700 INFO L225 Difference]: With dead ends: 220 [2025-01-10 02:26:09,700 INFO L226 Difference]: Without dead ends: 218 [2025-01-10 02:26:09,701 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:26:09,701 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 1 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 335 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:26:09,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 335 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:26:09,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-01-10 02:26:09,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-01-10 02:26:09,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 140 states have (on average 1.5285714285714285) internal successors, (214), 210 states have internal predecessors, (214), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:26:09,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 224 transitions. [2025-01-10 02:26:09,709 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 224 transitions. Word has length 54 [2025-01-10 02:26:09,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:26:09,709 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 224 transitions. [2025-01-10 02:26:09,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 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:26:09,709 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 224 transitions. [2025-01-10 02:26:09,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-10 02:26:09,710 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:26:09,710 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:26:09,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 02:26:09,710 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-01-10 02:26:09,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:26:09,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1156783568, now seen corresponding path program 1 times [2025-01-10 02:26:09,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:26:09,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682809729] [2025-01-10 02:26:09,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:09,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:26:09,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-10 02:26:09,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-10 02:26:09,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:09,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:26:09,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1501329205] [2025-01-10 02:26:09,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:09,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:26:09,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:26:09,729 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:26:09,735 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:26:09,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-10 02:26:09,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-10 02:26:09,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:09,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:26:09,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:26:09,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:26:09,864 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:26:09,864 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:26:09,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:26:09,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682809729] [2025-01-10 02:26:09,865 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:26:09,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501329205] [2025-01-10 02:26:09,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501329205] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:26:09,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:26:09,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:26:09,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807288057] [2025-01-10 02:26:09,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:26:09,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:26:09,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:26:09,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:26:09,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:26:09,866 INFO L87 Difference]: Start difference. First operand 218 states and 224 transitions. Second operand has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 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:26:10,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:26:10,152 INFO L93 Difference]: Finished difference Result 356 states and 372 transitions. [2025-01-10 02:26:10,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:26:10,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 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 59 [2025-01-10 02:26:10,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:26:10,153 INFO L225 Difference]: With dead ends: 356 [2025-01-10 02:26:10,153 INFO L226 Difference]: Without dead ends: 302 [2025-01-10 02:26:10,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 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:26:10,154 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 89 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:26:10,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 149 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:26:10,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-01-10 02:26:10,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 296. [2025-01-10 02:26:10,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 216 states have (on average 1.4074074074074074) internal successors, (304), 286 states have internal predecessors, (304), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 02:26:10,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 318 transitions. [2025-01-10 02:26:10,160 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 318 transitions. Word has length 59 [2025-01-10 02:26:10,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:26:10,161 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 318 transitions. [2025-01-10 02:26:10,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 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:26:10,161 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 318 transitions. [2025-01-10 02:26:10,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-10 02:26:10,162 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:26:10,162 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:26:10,168 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:26:10,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:26:10,366 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-01-10 02:26:10,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:26:10,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1891957014, now seen corresponding path program 1 times [2025-01-10 02:26:10,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:26:10,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883233096] [2025-01-10 02:26:10,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:10,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:26:10,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-10 02:26:10,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-10 02:26:10,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:10,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:26:10,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:26:10,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:26:10,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883233096] [2025-01-10 02:26:10,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883233096] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:26:10,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:26:10,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:26:10,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550223140] [2025-01-10 02:26:10,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:26:10,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:26:10,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:26:10,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:26:10,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:26:10,443 INFO L87 Difference]: Start difference. First operand 296 states and 318 transitions. Second operand has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 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:26:10,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:26:10,523 INFO L93 Difference]: Finished difference Result 297 states and 318 transitions. [2025-01-10 02:26:10,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:26:10,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 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 65 [2025-01-10 02:26:10,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:26:10,525 INFO L225 Difference]: With dead ends: 297 [2025-01-10 02:26:10,525 INFO L226 Difference]: Without dead ends: 296 [2025-01-10 02:26:10,525 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:26:10,525 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 38 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:26:10,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 278 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:26:10,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-01-10 02:26:10,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2025-01-10 02:26:10,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 216 states have (on average 1.4027777777777777) internal successors, (303), 286 states have internal predecessors, (303), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 02:26:10,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 317 transitions. [2025-01-10 02:26:10,532 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 317 transitions. Word has length 65 [2025-01-10 02:26:10,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:26:10,532 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 317 transitions. [2025-01-10 02:26:10,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 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:26:10,533 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 317 transitions. [2025-01-10 02:26:10,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-10 02:26:10,533 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:26:10,533 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:10,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 02:26:10,534 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-01-10 02:26:10,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:26:10,534 INFO L85 PathProgramCache]: Analyzing trace with hash 244763758, now seen corresponding path program 1 times [2025-01-10 02:26:10,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:26:10,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784809428] [2025-01-10 02:26:10,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:10,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:26:10,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-10 02:26:10,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-10 02:26:10,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:10,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:26:10,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [410342983] [2025-01-10 02:26:10,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:10,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:26:10,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:26:10,567 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:26:10,569 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:26:10,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-10 02:26:10,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-10 02:26:10,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:10,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:26:10,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:26:10,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:26:10,699 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-10 02:26:10,699 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:26:10,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:26:10,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784809428] [2025-01-10 02:26:10,699 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:26:10,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410342983] [2025-01-10 02:26:10,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410342983] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:26:10,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:26:10,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:26:10,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524763353] [2025-01-10 02:26:10,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:26:10,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:26:10,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:26:10,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:26:10,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:26:10,701 INFO L87 Difference]: Start difference. First operand 296 states and 317 transitions. Second operand has 3 states, 2 states have (on average 28.5) internal successors, (57), 3 states have internal predecessors, (57), 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:26:10,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:26:10,738 INFO L93 Difference]: Finished difference Result 296 states and 317 transitions. [2025-01-10 02:26:10,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:26:10,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 28.5) internal successors, (57), 3 states have internal predecessors, (57), 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 94 [2025-01-10 02:26:10,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:26:10,739 INFO L225 Difference]: With dead ends: 296 [2025-01-10 02:26:10,739 INFO L226 Difference]: Without dead ends: 293 [2025-01-10 02:26:10,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 91 SyntacticMatches, 1 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:26:10,740 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 95 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:26:10,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 158 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:26:10,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-01-10 02:26:10,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2025-01-10 02:26:10,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 216 states have (on average 1.3796296296296295) internal successors, (298), 283 states have internal predecessors, (298), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 02:26:10,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 312 transitions. [2025-01-10 02:26:10,747 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 312 transitions. Word has length 94 [2025-01-10 02:26:10,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:26:10,747 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 312 transitions. [2025-01-10 02:26:10,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 28.5) internal successors, (57), 3 states have internal predecessors, (57), 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:26:10,747 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 312 transitions. [2025-01-10 02:26:10,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-10 02:26:10,748 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:26:10,748 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:26:10,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 02:26:10,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:26:10,952 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-01-10 02:26:10,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:26:10,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1002257996, now seen corresponding path program 1 times [2025-01-10 02:26:10,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:26:10,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908212762] [2025-01-10 02:26:10,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:10,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:26:10,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-10 02:26:10,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-10 02:26:10,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:10,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:26:10,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1270782716] [2025-01-10 02:26:10,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:10,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:26:10,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:26:10,974 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:26:10,975 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:26:10,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-10 02:26:11,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-10 02:26:11,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:11,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:26:11,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 02:26:11,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:26:11,169 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:26:11,169 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:26:11,318 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:26:11,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:26:11,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908212762] [2025-01-10 02:26:11,319 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:26:11,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270782716] [2025-01-10 02:26:11,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270782716] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:26:11,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:26:11,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-01-10 02:26:11,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210598440] [2025-01-10 02:26:11,319 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:26:11,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 02:26:11,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:26:11,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 02:26:11,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:26:11,320 INFO L87 Difference]: Start difference. First operand 293 states and 312 transitions. Second operand has 8 states, 7 states have (on average 23.428571428571427) internal successors, (164), 8 states have internal predecessors, (164), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 02:26:11,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:26:11,873 INFO L93 Difference]: Finished difference Result 364 states and 379 transitions. [2025-01-10 02:26:11,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:26:11,874 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 23.428571428571427) internal successors, (164), 8 states have internal predecessors, (164), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 95 [2025-01-10 02:26:11,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:26:11,875 INFO L225 Difference]: With dead ends: 364 [2025-01-10 02:26:11,875 INFO L226 Difference]: Without dead ends: 357 [2025-01-10 02:26:11,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:26:11,876 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 285 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 02:26:11,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 310 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 02:26:11,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-01-10 02:26:11,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 330. [2025-01-10 02:26:11,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 254 states have (on average 1.4015748031496063) internal successors, (356), 320 states have internal predecessors, (356), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 02:26:11,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 370 transitions. [2025-01-10 02:26:11,883 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 370 transitions. Word has length 95 [2025-01-10 02:26:11,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:26:11,883 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 370 transitions. [2025-01-10 02:26:11,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 23.428571428571427) internal successors, (164), 8 states have internal predecessors, (164), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 02:26:11,884 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 370 transitions. [2025-01-10 02:26:11,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-10 02:26:11,884 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:26:11,884 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, 1, 1, 1, 1, 1, 1, 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:26:11,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 02:26:12,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-10 02:26:12,089 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-01-10 02:26:12,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:26:12,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1005226704, now seen corresponding path program 1 times [2025-01-10 02:26:12,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:26:12,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191980674] [2025-01-10 02:26:12,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:12,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:26:12,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-10 02:26:12,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-10 02:26:12,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:12,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:26:12,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [564240806] [2025-01-10 02:26:12,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:12,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:26:12,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:26:12,120 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:26:12,124 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:26:12,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-10 02:26:12,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-10 02:26:12,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:12,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:26:12,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 02:26:12,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:26:12,407 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:26:12,408 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:26:13,239 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:26:13,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:26:13,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191980674] [2025-01-10 02:26:13,239 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:26:13,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564240806] [2025-01-10 02:26:13,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564240806] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 02:26:13,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:26:13,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2025-01-10 02:26:13,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259358607] [2025-01-10 02:26:13,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:26:13,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:26:13,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:26:13,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:26:13,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:26:13,241 INFO L87 Difference]: Start difference. First operand 330 states and 370 transitions. Second operand has 6 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 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:26:18,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:26:20,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:26:23,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:26:25,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:26:30,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:26:33,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:26:35,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:26:38,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:26:40,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:26:44,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:26:47,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:26:51,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:26:51,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:26:51,404 INFO L93 Difference]: Finished difference Result 330 states and 370 transitions. [2025-01-10 02:26:51,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:26:51,405 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 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 96 [2025-01-10 02:26:51,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:26:51,406 INFO L225 Difference]: With dead ends: 330 [2025-01-10 02:26:51,406 INFO L226 Difference]: Without dead ends: 328 [2025-01-10 02:26:51,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:26:51,406 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 145 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 8 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:26:51,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 81 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 481 Invalid, 4 Unknown, 0 Unchecked, 38.1s Time] [2025-01-10 02:26:51,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-01-10 02:26:51,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2025-01-10 02:26:51,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 254 states have (on average 1.3858267716535433) internal successors, (352), 318 states have internal predecessors, (352), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 02:26:51,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 366 transitions. [2025-01-10 02:26:51,414 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 366 transitions. Word has length 96 [2025-01-10 02:26:51,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:26:51,414 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 366 transitions. [2025-01-10 02:26:51,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 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:26:51,414 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 366 transitions. [2025-01-10 02:26:51,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-10 02:26:51,415 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:26:51,415 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, 1, 1, 1, 1, 1, 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:26:51,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 02:26:51,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-10 02:26:51,616 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-01-10 02:26:51,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:26:51,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1097256650, now seen corresponding path program 1 times [2025-01-10 02:26:51,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:26:51,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027023992] [2025-01-10 02:26:51,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:51,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:26:51,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-10 02:26:51,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-10 02:26:51,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:51,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:26:51,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1330403358] [2025-01-10 02:26:51,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:51,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:26:51,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:26:51,661 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:26:51,662 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:26:51,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-10 02:26:51,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-10 02:26:51,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:51,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:26:51,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 02:26:51,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:26:51,796 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:26:51,796 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:26:51,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:26:51,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027023992] [2025-01-10 02:26:51,796 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:26:51,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330403358] [2025-01-10 02:26:51,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330403358] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:26:51,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:26:51,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:26:51,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760255719] [2025-01-10 02:26:51,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:26:51,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:26:51,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:26:51,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:26:51,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:26:51,797 INFO L87 Difference]: Start difference. First operand 328 states and 366 transitions. Second operand has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 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:26:52,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:26:52,007 INFO L93 Difference]: Finished difference Result 328 states and 366 transitions. [2025-01-10 02:26:52,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:26:52,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 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 97 [2025-01-10 02:26:52,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:26:52,009 INFO L225 Difference]: With dead ends: 328 [2025-01-10 02:26:52,010 INFO L226 Difference]: Without dead ends: 308 [2025-01-10 02:26:52,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:26:52,011 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 200 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:26:52,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 46 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:26:52,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-01-10 02:26:52,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2025-01-10 02:26:52,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 254 states have (on average 1.2677165354330708) internal successors, (322), 298 states have internal predecessors, (322), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 02:26:52,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 336 transitions. [2025-01-10 02:26:52,020 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 336 transitions. Word has length 97 [2025-01-10 02:26:52,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:26:52,020 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 336 transitions. [2025-01-10 02:26:52,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 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:26:52,020 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 336 transitions. [2025-01-10 02:26:52,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-10 02:26:52,021 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:26:52,021 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, 1, 1, 1, 1, 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:26:52,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 02:26:52,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-10 02:26:52,225 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-01-10 02:26:52,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:26:52,226 INFO L85 PathProgramCache]: Analyzing trace with hash 344782322, now seen corresponding path program 1 times [2025-01-10 02:26:52,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:26:52,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107765182] [2025-01-10 02:26:52,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:52,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:26:52,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-10 02:26:52,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-10 02:26:52,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:52,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:26:52,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1073072882] [2025-01-10 02:26:52,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:52,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:26:52,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:26:52,244 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:26:52,246 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:26:52,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-10 02:26:52,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-10 02:26:52,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:52,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:26:52,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 02:26:52,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:26:52,488 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:26:52,489 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:26:52,662 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-10 02:26:52,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:26:52,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107765182] [2025-01-10 02:26:52,662 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:26:52,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073072882] [2025-01-10 02:26:52,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073072882] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 02:26:52,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:26:52,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-10 02:26:52,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939697398] [2025-01-10 02:26:52,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:26:52,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:26:52,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:26:52,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:26:52,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:26:52,664 INFO L87 Difference]: Start difference. First operand 308 states and 336 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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:26:57,094 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:26:58,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:27:02,929 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:08,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:27:08,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:08,340 INFO L93 Difference]: Finished difference Result 308 states and 336 transitions. [2025-01-10 02:27:08,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:27:08,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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 98 [2025-01-10 02:27:08,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:08,343 INFO L225 Difference]: With dead ends: 308 [2025-01-10 02:27:08,343 INFO L226 Difference]: Without dead ends: 306 [2025-01-10 02:27:08,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:27:08,344 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 78 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.7s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:08,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 55 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 278 Invalid, 3 Unknown, 0 Unchecked, 15.7s Time] [2025-01-10 02:27:08,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-01-10 02:27:08,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2025-01-10 02:27:08,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 254 states have (on average 1.2519685039370079) internal successors, (318), 296 states have internal predecessors, (318), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 02:27:08,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 332 transitions. [2025-01-10 02:27:08,380 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 332 transitions. Word has length 98 [2025-01-10 02:27:08,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:08,380 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 332 transitions. [2025-01-10 02:27:08,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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:08,380 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 332 transitions. [2025-01-10 02:27:08,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-10 02:27:08,380 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:08,381 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, 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,392 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:08,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:08,581 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-01-10 02:27:08,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:08,583 INFO L85 PathProgramCache]: Analyzing trace with hash -570018897, now seen corresponding path program 1 times [2025-01-10 02:27:08,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:08,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323781388] [2025-01-10 02:27:08,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:08,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:08,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-10 02:27:08,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-10 02:27:08,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:08,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:08,706 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 02:27:08,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:08,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323781388] [2025-01-10 02:27:08,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323781388] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:27:08,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31631869] [2025-01-10 02:27:08,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:08,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:08,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:27:08,709 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:08,710 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:08,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-10 02:27:08,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-10 02:27:08,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:08,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:08,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:27:08,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:27:08,825 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 02:27:08,826 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:27:08,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31631869] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:27:08,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:27:08,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 02:27:08,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829629880] [2025-01-10 02:27:08,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:27:08,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:27:08,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:08,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:27:08,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:27:08,827 INFO L87 Difference]: Start difference. First operand 306 states and 332 transitions. Second operand has 4 states, 3 states have (on average 30.666666666666668) internal successors, (92), 4 states have internal predecessors, (92), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 02:27:08,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:08,846 INFO L93 Difference]: Finished difference Result 306 states and 332 transitions. [2025-01-10 02:27:08,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:27:08,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 30.666666666666668) internal successors, (92), 4 states have internal predecessors, (92), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 106 [2025-01-10 02:27:08,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:08,847 INFO L225 Difference]: With dead ends: 306 [2025-01-10 02:27:08,847 INFO L226 Difference]: Without dead ends: 305 [2025-01-10 02:27:08,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 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:08,848 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 25 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:08,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 347 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:27:08,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-01-10 02:27:08,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2025-01-10 02:27:08,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 254 states have (on average 1.2440944881889764) internal successors, (316), 295 states have internal predecessors, (316), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 02:27:08,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 330 transitions. [2025-01-10 02:27:08,855 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 330 transitions. Word has length 106 [2025-01-10 02:27:08,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:08,856 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 330 transitions. [2025-01-10 02:27:08,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 30.666666666666668) internal successors, (92), 4 states have internal predecessors, (92), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 02:27:08,856 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 330 transitions. [2025-01-10 02:27:08,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-10 02:27:08,856 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:08,856 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] [2025-01-10 02:27:08,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 02:27:09,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:09,061 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-01-10 02:27:09,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:09,062 INFO L85 PathProgramCache]: Analyzing trace with hash -490716507, now seen corresponding path program 1 times [2025-01-10 02:27:09,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:09,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58516808] [2025-01-10 02:27:09,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:09,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:09,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-10 02:27:09,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-10 02:27:09,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:09,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:09,124 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 02:27:09,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:09,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58516808] [2025-01-10 02:27:09,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58516808] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:27:09,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253013173] [2025-01-10 02:27:09,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:09,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:09,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:27:09,127 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:09,128 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:09,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-10 02:27:09,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-10 02:27:09,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:09,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:09,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:27:09,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:27:09,238 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 02:27:09,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:27:09,333 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 02:27:09,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253013173] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:27:09,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:27:09,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 02:27:09,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132867255] [2025-01-10 02:27:09,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:27:09,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:27:09,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:09,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:27:09,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:27:09,334 INFO L87 Difference]: Start difference. First operand 305 states and 330 transitions. Second operand has 7 states, 6 states have (on average 36.0) internal successors, (216), 7 states have internal predecessors, (216), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-01-10 02:27:09,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:09,369 INFO L93 Difference]: Finished difference Result 403 states and 416 transitions. [2025-01-10 02:27:09,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:27:09,369 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 36.0) internal successors, (216), 7 states have internal predecessors, (216), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 107 [2025-01-10 02:27:09,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:09,371 INFO L225 Difference]: With dead ends: 403 [2025-01-10 02:27:09,371 INFO L226 Difference]: Without dead ends: 402 [2025-01-10 02:27:09,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 210 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:09,371 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 51 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:09,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 729 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:27:09,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-01-10 02:27:09,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 361. [2025-01-10 02:27:09,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 308 states have (on average 1.2824675324675325) internal successors, (395), 349 states have internal predecessors, (395), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 02:27:09,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 413 transitions. [2025-01-10 02:27:09,381 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 413 transitions. Word has length 107 [2025-01-10 02:27:09,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:09,381 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 413 transitions. [2025-01-10 02:27:09,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 36.0) internal successors, (216), 7 states have internal predecessors, (216), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-01-10 02:27:09,381 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 413 transitions. [2025-01-10 02:27:09,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-10 02:27:09,382 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:09,382 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:27:09,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 02:27:09,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:09,586 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-01-10 02:27:09,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:09,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1341418535, now seen corresponding path program 1 times [2025-01-10 02:27:09,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:09,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917816429] [2025-01-10 02:27:09,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:09,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:09,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-10 02:27:09,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-10 02:27:09,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:09,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:09,638 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 02:27:09,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:09,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917816429] [2025-01-10 02:27:09,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917816429] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:27:09,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:27:09,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:27:09,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403857870] [2025-01-10 02:27:09,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:27:09,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:27:09,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:09,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:27:09,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:27:09,639 INFO L87 Difference]: Start difference. First operand 361 states and 413 transitions. Second operand has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 02:27:09,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:09,780 INFO L93 Difference]: Finished difference Result 361 states and 413 transitions. [2025-01-10 02:27:09,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:27:09,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 118 [2025-01-10 02:27:09,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:09,782 INFO L225 Difference]: With dead ends: 361 [2025-01-10 02:27:09,782 INFO L226 Difference]: Without dead ends: 354 [2025-01-10 02:27:09,782 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,783 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 78 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:09,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 53 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:27:09,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-01-10 02:27:09,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2025-01-10 02:27:09,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 308 states have (on average 1.2370129870129871) internal successors, (381), 342 states have internal predecessors, (381), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 02:27:09,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 399 transitions. [2025-01-10 02:27:09,792 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 399 transitions. Word has length 118 [2025-01-10 02:27:09,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:09,793 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 399 transitions. [2025-01-10 02:27:09,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 02:27:09,793 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 399 transitions. [2025-01-10 02:27:09,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-10 02:27:09,794 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:09,794 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:27:09,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 02:27:09,794 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-01-10 02:27:09,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:09,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1365698417, now seen corresponding path program 1 times [2025-01-10 02:27:09,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:09,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195380060] [2025-01-10 02:27:09,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:09,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:09,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-10 02:27:09,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-10 02:27:09,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:09,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:09,877 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-10 02:27:09,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:09,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195380060] [2025-01-10 02:27:09,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195380060] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:27:09,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:27:09,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:27:09,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913904592] [2025-01-10 02:27:09,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:27:09,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:27:09,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:09,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:27:09,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:27:09,879 INFO L87 Difference]: Start difference. First operand 354 states and 399 transitions. Second operand has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 02:27:09,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:09,992 INFO L93 Difference]: Finished difference Result 354 states and 399 transitions. [2025-01-10 02:27:09,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:27:09,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 119 [2025-01-10 02:27:09,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:09,993 INFO L225 Difference]: With dead ends: 354 [2025-01-10 02:27:09,994 INFO L226 Difference]: Without dead ends: 353 [2025-01-10 02:27:09,994 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,994 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 107 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:09,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 40 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:27:09,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-01-10 02:27:10,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2025-01-10 02:27:10,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 308 states have (on average 1.2272727272727273) internal successors, (378), 341 states have internal predecessors, (378), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 02:27:10,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 396 transitions. [2025-01-10 02:27:10,006 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 396 transitions. Word has length 119 [2025-01-10 02:27:10,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:10,006 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 396 transitions. [2025-01-10 02:27:10,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 02:27:10,007 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 396 transitions. [2025-01-10 02:27:10,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-10 02:27:10,007 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:10,007 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:27:10,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 02:27:10,008 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-01-10 02:27:10,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:10,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1823812429, now seen corresponding path program 1 times [2025-01-10 02:27:10,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:10,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205411651] [2025-01-10 02:27:10,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:10,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:10,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-10 02:27:10,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-10 02:27:10,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:10,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:27:10,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1583714935] [2025-01-10 02:27:10,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:10,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:10,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:27:10,035 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:10,040 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:10,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-10 02:27:10,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-10 02:27:10,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:10,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:10,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 02:27:10,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:27:10,172 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 02:27:10,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:27:10,331 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 02:27:10,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:10,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205411651] [2025-01-10 02:27:10,331 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:27:10,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583714935] [2025-01-10 02:27:10,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583714935] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:27:10,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:27:10,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-01-10 02:27:10,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630783050] [2025-01-10 02:27:10,332 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:27:10,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 02:27:10,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:10,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 02:27:10,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:27:10,333 INFO L87 Difference]: Start difference. First operand 353 states and 396 transitions. Second operand has 8 states, 7 states have (on average 29.428571428571427) internal successors, (206), 8 states have internal predecessors, (206), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-10 02:27:10,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:10,772 INFO L93 Difference]: Finished difference Result 414 states and 449 transitions. [2025-01-10 02:27:10,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:27:10,772 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 29.428571428571427) internal successors, (206), 8 states have internal predecessors, (206), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 121 [2025-01-10 02:27:10,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:10,774 INFO L225 Difference]: With dead ends: 414 [2025-01-10 02:27:10,774 INFO L226 Difference]: Without dead ends: 384 [2025-01-10 02:27:10,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:27:10,774 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 417 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:10,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 158 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 02:27:10,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-01-10 02:27:10,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 337. [2025-01-10 02:27:10,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 297 states have (on average 1.1683501683501682) internal successors, (347), 326 states have internal predecessors, (347), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 02:27:10,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 363 transitions. [2025-01-10 02:27:10,784 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 363 transitions. Word has length 121 [2025-01-10 02:27:10,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:10,784 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 363 transitions. [2025-01-10 02:27:10,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 29.428571428571427) internal successors, (206), 8 states have internal predecessors, (206), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-10 02:27:10,784 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 363 transitions. [2025-01-10 02:27:10,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-10 02:27:10,785 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:10,785 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-10 02:27:10,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 02:27:10,986 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-01-10 02:27:10,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:10,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1842179412, now seen corresponding path program 1 times [2025-01-10 02:27:10,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:10,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645514666] [2025-01-10 02:27:10,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:10,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:10,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-10 02:27:10,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-10 02:27:10,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:10,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:27:11,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1662871809] [2025-01-10 02:27:11,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:11,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:11,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:27:11,002 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:11,003 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:11,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-10 02:27:11,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-10 02:27:11,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:11,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:11,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 02:27:11,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:27:11,338 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 02:27:11,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:27:11,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:11,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645514666] [2025-01-10 02:27:11,923 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:27:11,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662871809] [2025-01-10 02:27:11,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662871809] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:27:11,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:27:11,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-01-10 02:27:11,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256822199] [2025-01-10 02:27:11,923 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-10 02:27:11,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:27:11,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:11,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:27:11,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-01-10 02:27:11,924 INFO L87 Difference]: Start difference. First operand 337 states and 363 transitions. Second operand has 7 states, 6 states have (on average 21.0) internal successors, (126), 7 states have internal predecessors, (126), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-10 02:27:12,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:12,225 INFO L93 Difference]: Finished difference Result 375 states and 402 transitions. [2025-01-10 02:27:12,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:27:12,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 21.0) internal successors, (126), 7 states have internal predecessors, (126), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 145 [2025-01-10 02:27:12,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:12,226 INFO L225 Difference]: With dead ends: 375 [2025-01-10 02:27:12,226 INFO L226 Difference]: Without dead ends: 374 [2025-01-10 02:27:12,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-01-10 02:27:12,227 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 19 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:12,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 271 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:27:12,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-01-10 02:27:12,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2025-01-10 02:27:12,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 332 states have (on average 1.1506024096385543) internal successors, (382), 361 states have internal predecessors, (382), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 02:27:12,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 400 transitions. [2025-01-10 02:27:12,237 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 400 transitions. Word has length 145 [2025-01-10 02:27:12,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:12,237 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 400 transitions. [2025-01-10 02:27:12,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 21.0) internal successors, (126), 7 states have internal predecessors, (126), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-10 02:27:12,238 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 400 transitions. [2025-01-10 02:27:12,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-10 02:27:12,238 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:12,238 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,247 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:12,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:12,439 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-01-10 02:27:12,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:12,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1272986712, now seen corresponding path program 1 times [2025-01-10 02:27:12,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:12,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753661785] [2025-01-10 02:27:12,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:12,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:12,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-10 02:27:12,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-10 02:27:12,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:12,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:27:12,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [14292558] [2025-01-10 02:27:12,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:12,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:12,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:27:12,459 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:12,461 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:12,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-10 02:27:12,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-10 02:27:12,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:12,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:12,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 02:27:12,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:27:12,862 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 02:27:12,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:27:13,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:13,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753661785] [2025-01-10 02:27:13,593 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:27:13,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14292558] [2025-01-10 02:27:13,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14292558] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:27:13,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:27:13,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-01-10 02:27:13,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850839079] [2025-01-10 02:27:13,593 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-10 02:27:13,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:27:13,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:13,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:27:13,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-01-10 02:27:13,594 INFO L87 Difference]: Start difference. First operand 373 states and 400 transitions. Second operand has 7 states, 6 states have (on average 21.166666666666668) internal successors, (127), 7 states have internal predecessors, (127), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-10 02:27:13,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:13,841 INFO L93 Difference]: Finished difference Result 375 states and 401 transitions. [2025-01-10 02:27:13,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:27:13,841 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 21.166666666666668) internal successors, (127), 7 states have internal predecessors, (127), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 146 [2025-01-10 02:27:13,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:13,842 INFO L225 Difference]: With dead ends: 375 [2025-01-10 02:27:13,843 INFO L226 Difference]: Without dead ends: 337 [2025-01-10 02:27:13,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-01-10 02:27:13,843 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 21 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:13,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 288 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:27:13,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-01-10 02:27:13,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2025-01-10 02:27:13,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 297 states have (on average 1.164983164983165) internal successors, (346), 326 states have internal predecessors, (346), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 02:27:13,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 362 transitions. [2025-01-10 02:27:13,852 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 362 transitions. Word has length 146 [2025-01-10 02:27:13,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:13,852 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 362 transitions. [2025-01-10 02:27:13,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 21.166666666666668) internal successors, (127), 7 states have internal predecessors, (127), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-10 02:27:13,852 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 362 transitions. [2025-01-10 02:27:13,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-10 02:27:13,853 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:13,853 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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:27:13,863 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:14,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:14,057 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-01-10 02:27:14,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:14,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1174483524, now seen corresponding path program 1 times [2025-01-10 02:27:14,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:14,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002303955] [2025-01-10 02:27:14,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:14,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:14,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-10 02:27:14,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-10 02:27:14,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:14,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:27:14,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1079456035] [2025-01-10 02:27:14,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:14,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:14,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:27:14,082 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:14,085 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:14,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-10 02:27:14,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-10 02:27:14,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:14,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:14,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:27:14,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:27:14,275 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 02:27:14,275 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:27:14,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:14,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002303955] [2025-01-10 02:27:14,275 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:27:14,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079456035] [2025-01-10 02:27:14,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079456035] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:27:14,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:27:14,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:27:14,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334385892] [2025-01-10 02:27:14,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:27:14,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:27:14,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:14,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:27:14,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:27:14,277 INFO L87 Difference]: Start difference. First operand 337 states and 362 transitions. Second operand has 6 states, 5 states have (on average 29.0) internal successors, (145), 6 states have internal predecessors, (145), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-10 02:27:14,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:14,576 INFO L93 Difference]: Finished difference Result 347 states and 374 transitions. [2025-01-10 02:27:14,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:27:14,577 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 29.0) internal successors, (145), 6 states have internal predecessors, (145), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 164 [2025-01-10 02:27:14,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:14,578 INFO L225 Difference]: With dead ends: 347 [2025-01-10 02:27:14,578 INFO L226 Difference]: Without dead ends: 334 [2025-01-10 02:27:14,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:27:14,578 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 118 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:14,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 137 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:27:14,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-01-10 02:27:14,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 321. [2025-01-10 02:27:14,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 294 states have (on average 1.098639455782313) internal successors, (323), 310 states have internal predecessors, (323), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 02:27:14,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 339 transitions. [2025-01-10 02:27:14,605 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 339 transitions. Word has length 164 [2025-01-10 02:27:14,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:14,605 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 339 transitions. [2025-01-10 02:27:14,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 29.0) internal successors, (145), 6 states have internal predecessors, (145), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-10 02:27:14,605 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 339 transitions. [2025-01-10 02:27:14,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-10 02:27:14,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:14,606 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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:27:14,612 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:27:14,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:14,807 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-01-10 02:27:14,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:14,807 INFO L85 PathProgramCache]: Analyzing trace with hash -2049250748, now seen corresponding path program 1 times [2025-01-10 02:27:14,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:14,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748979233] [2025-01-10 02:27:14,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:14,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:14,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-10 02:27:14,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-10 02:27:14,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:14,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:27:14,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1909440176] [2025-01-10 02:27:14,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:14,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:14,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:27:14,827 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:27:14,834 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:27:14,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-10 02:27:14,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-10 02:27:14,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:14,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:14,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:27:14,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:27:15,011 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 02:27:15,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:27:15,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:15,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748979233] [2025-01-10 02:27:15,056 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:27:15,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909440176] [2025-01-10 02:27:15,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909440176] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:27:15,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:27:15,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-01-10 02:27:15,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169744207] [2025-01-10 02:27:15,056 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-10 02:27:15,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:27:15,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:15,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:27:15,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:27:15,057 INFO L87 Difference]: Start difference. First operand 321 states and 339 transitions. Second operand has 6 states, 5 states have (on average 29.2) internal successors, (146), 6 states have internal predecessors, (146), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-10 02:27:15,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:15,351 INFO L93 Difference]: Finished difference Result 377 states and 399 transitions. [2025-01-10 02:27:15,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:27:15,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 29.2) internal successors, (146), 6 states have internal predecessors, (146), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 165 [2025-01-10 02:27:15,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:15,353 INFO L225 Difference]: With dead ends: 377 [2025-01-10 02:27:15,353 INFO L226 Difference]: Without dead ends: 374 [2025-01-10 02:27:15,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:27:15,354 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 116 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:15,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 109 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:27:15,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-01-10 02:27:15,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 321. [2025-01-10 02:27:15,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 294 states have (on average 1.08843537414966) internal successors, (320), 310 states have internal predecessors, (320), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 02:27:15,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 336 transitions. [2025-01-10 02:27:15,362 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 336 transitions. Word has length 165 [2025-01-10 02:27:15,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:15,362 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 336 transitions. [2025-01-10 02:27:15,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 29.2) internal successors, (146), 6 states have internal predecessors, (146), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-10 02:27:15,363 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 336 transitions. [2025-01-10 02:27:15,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-10 02:27:15,363 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:15,364 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, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:27:15,374 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:27:15,564 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,SelfDestructingSolverStorable21 [2025-01-10 02:27:15,564 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-01-10 02:27:15,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:15,564 INFO L85 PathProgramCache]: Analyzing trace with hash 2060024198, now seen corresponding path program 1 times [2025-01-10 02:27:15,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:15,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697700232] [2025-01-10 02:27:15,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:15,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:15,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-10 02:27:15,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-10 02:27:15,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:15,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:27:15,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1633241952] [2025-01-10 02:27:15,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:15,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:15,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:27:15,583 INFO L229 MonitoredProcess]: Starting monitored process 16 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:15,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-10 02:27:15,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-10 02:27:15,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-10 02:27:15,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:15,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:15,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 02:27:15,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:27:15,765 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 02:27:15,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:27:16,065 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 02:27:16,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:16,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697700232] [2025-01-10 02:27:16,066 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:27:16,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633241952] [2025-01-10 02:27:16,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633241952] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:27:16,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:27:16,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-01-10 02:27:16,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432954225] [2025-01-10 02:27:16,066 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:27:16,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 02:27:16,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:16,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 02:27:16,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:27:16,067 INFO L87 Difference]: Start difference. First operand 321 states and 336 transitions. Second operand has 10 states, 9 states have (on average 32.0) internal successors, (288), 10 states have internal predecessors, (288), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-01-10 02:27:16,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:16,508 INFO L93 Difference]: Finished difference Result 394 states and 417 transitions. [2025-01-10 02:27:16,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:27:16,508 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 32.0) internal successors, (288), 10 states have internal predecessors, (288), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 167 [2025-01-10 02:27:16,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:16,510 INFO L225 Difference]: With dead ends: 394 [2025-01-10 02:27:16,510 INFO L226 Difference]: Without dead ends: 383 [2025-01-10 02:27:16,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2025-01-10 02:27:16,510 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 626 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:16,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 207 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 02:27:16,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-01-10 02:27:16,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 308. [2025-01-10 02:27:16,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 288 states have (on average 1.0486111111111112) internal successors, (302), 297 states have internal predecessors, (302), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 02:27:16,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 318 transitions. [2025-01-10 02:27:16,519 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 318 transitions. Word has length 167 [2025-01-10 02:27:16,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:16,519 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 318 transitions. [2025-01-10 02:27:16,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 32.0) internal successors, (288), 10 states have internal predecessors, (288), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-01-10 02:27:16,519 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 318 transitions. [2025-01-10 02:27:16,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-10 02:27:16,520 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:16,520 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:27:16,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-01-10 02:27:16,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:16,724 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-01-10 02:27:16,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:16,725 INFO L85 PathProgramCache]: Analyzing trace with hash -296664888, now seen corresponding path program 1 times [2025-01-10 02:27:16,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:16,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086787985] [2025-01-10 02:27:16,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:16,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:16,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-10 02:27:16,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-10 02:27:16,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:16,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:27:16,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2048824529] [2025-01-10 02:27:16,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:27:16,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:16,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:27:16,751 INFO L229 MonitoredProcess]: Starting monitored process 17 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:16,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-10 02:27:16,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-10 02:27:16,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-10 02:27:16,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:27:16,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:16,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 02:27:16,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:27:17,122 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 02:27:17,122 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:27:17,429 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 02:27:17,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:17,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086787985] [2025-01-10 02:27:17,429 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:27:17,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048824529] [2025-01-10 02:27:17,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048824529] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:27:17,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:27:17,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-01-10 02:27:17,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673928419] [2025-01-10 02:27:17,430 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:27:17,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 02:27:17,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:17,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 02:27:17,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-01-10 02:27:17,431 INFO L87 Difference]: Start difference. First operand 308 states and 318 transitions. Second operand has 14 states, 13 states have (on average 22.46153846153846) internal successors, (292), 14 states have internal predecessors, (292), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-01-10 02:27:18,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:18,339 INFO L93 Difference]: Finished difference Result 547 states and 583 transitions. [2025-01-10 02:27:18,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 02:27:18,339 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 22.46153846153846) internal successors, (292), 14 states have internal predecessors, (292), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 169 [2025-01-10 02:27:18,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:18,341 INFO L225 Difference]: With dead ends: 547 [2025-01-10 02:27:18,342 INFO L226 Difference]: Without dead ends: 546 [2025-01-10 02:27:18,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=179, Unknown=0, NotChecked=0, Total=306 [2025-01-10 02:27:18,342 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 418 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 1575 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:18,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 212 Invalid, 1593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1575 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 02:27:18,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2025-01-10 02:27:18,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 414. [2025-01-10 02:27:18,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 392 states have (on average 1.0637755102040816) internal successors, (417), 401 states have internal predecessors, (417), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 02:27:18,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 437 transitions. [2025-01-10 02:27:18,355 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 437 transitions. Word has length 169 [2025-01-10 02:27:18,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:18,356 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 437 transitions. [2025-01-10 02:27:18,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 22.46153846153846) internal successors, (292), 14 states have internal predecessors, (292), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-01-10 02:27:18,356 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 437 transitions. [2025-01-10 02:27:18,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-10 02:27:18,357 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:18,357 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-01-10 02:27:18,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:18,561 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-01-10 02:27:18,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:18,562 INFO L85 PathProgramCache]: Analyzing trace with hash -474500667, now seen corresponding path program 2 times [2025-01-10 02:27:18,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:18,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145700296] [2025-01-10 02:27:18,562 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:27:18,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:18,570 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 197 statements into 2 equivalence classes. [2025-01-10 02:27:18,581 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 197 of 197 statements. [2025-01-10 02:27:18,582 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:27:18,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:27:18,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1645884224] [2025-01-10 02:27:18,583 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:27:18,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:18,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:27:18,586 INFO L229 MonitoredProcess]: Starting monitored process 18 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:18,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-10 02:27:18,613 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 197 statements into 2 equivalence classes. [2025-01-10 02:27:18,623 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 48 of 197 statements. [2025-01-10 02:27:18,624 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 02:27:18,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:27:18,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 02:27:18,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:27:19,164 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-10 02:27:19,164 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:27:19,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:27:19,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145700296] [2025-01-10 02:27:19,164 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:27:19,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645884224] [2025-01-10 02:27:19,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645884224] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:27:19,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:27:19,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:27:19,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921958149] [2025-01-10 02:27:19,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:27:19,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:27:19,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:27:19,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:27:19,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:27:19,169 INFO L87 Difference]: Start difference. First operand 414 states and 437 transitions. Second operand has 4 states, 3 states have (on average 36.333333333333336) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:27:19,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:27:19,281 INFO L93 Difference]: Finished difference Result 414 states and 437 transitions. [2025-01-10 02:27:19,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:27:19,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 36.333333333333336) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 197 [2025-01-10 02:27:19,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:27:19,283 INFO L225 Difference]: With dead ends: 414 [2025-01-10 02:27:19,283 INFO L226 Difference]: Without dead ends: 355 [2025-01-10 02:27:19,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 194 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:19,283 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 31 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:27:19,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 48 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:27:19,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-01-10 02:27:19,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2025-01-10 02:27:19,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 338 states have (on average 1.0502958579881656) internal successors, (355), 343 states have internal predecessors, (355), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 02:27:19,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 373 transitions. [2025-01-10 02:27:19,299 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 373 transitions. Word has length 197 [2025-01-10 02:27:19,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:27:19,300 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 373 transitions. [2025-01-10 02:27:19,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 36.333333333333336) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:27:19,300 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 373 transitions. [2025-01-10 02:27:19,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-01-10 02:27:19,301 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:27:19,301 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:27:19,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-01-10 02:27:19,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:19,501 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-01-10 02:27:19,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:27:19,502 INFO L85 PathProgramCache]: Analyzing trace with hash 506725862, now seen corresponding path program 2 times [2025-01-10 02:27:19,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:27:19,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246338539] [2025-01-10 02:27:19,502 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:27:19,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:27:19,509 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 199 statements into 2 equivalence classes. [2025-01-10 02:27:19,531 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 199 of 199 statements. [2025-01-10 02:27:19,531 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:27:19,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:27:19,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [209732286] [2025-01-10 02:27:19,532 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:27:19,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:27:19,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:27:19,538 INFO L229 MonitoredProcess]: Starting monitored process 19 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:19,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-01-10 02:27:19,561 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 199 statements into 2 equivalence classes. [2025-01-10 02:27:19,591 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 199 of 199 statements. [2025-01-10 02:27:19,591 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:27:19,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:27:19,592 WARN L124 FreeRefinementEngine]: Strategy CAMEL was unsuccessful and could not determine trace feasibility [2025-01-10 02:27:19,592 INFO L340 BasicCegarLoop]: Counterexample might be feasible [2025-01-10 02:27:19,596 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 84 remaining) [2025-01-10 02:27:19,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 84 remaining) [2025-01-10 02:27:19,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 84 remaining) [2025-01-10 02:27:19,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 84 remaining) [2025-01-10 02:27:19,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 84 remaining) [2025-01-10 02:27:19,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 84 remaining) [2025-01-10 02:27:19,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 84 remaining) [2025-01-10 02:27:19,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 84 remaining) [2025-01-10 02:27:19,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 84 remaining) [2025-01-10 02:27:19,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 84 remaining) [2025-01-10 02:27:19,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 84 remaining) [2025-01-10 02:27:19,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 84 remaining) [2025-01-10 02:27:19,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 84 remaining) [2025-01-10 02:27:19,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 84 remaining) [2025-01-10 02:27:19,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 84 remaining) [2025-01-10 02:27:19,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 84 remaining) [2025-01-10 02:27:19,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 84 remaining) [2025-01-10 02:27:19,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 84 remaining) [2025-01-10 02:27:19,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 84 remaining) [2025-01-10 02:27:19,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 84 remaining) [2025-01-10 02:27:19,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 84 remaining) [2025-01-10 02:27:19,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 84 remaining) [2025-01-10 02:27:19,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 84 remaining) [2025-01-10 02:27:19,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 84 remaining) [2025-01-10 02:27:19,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 84 remaining) [2025-01-10 02:27:19,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 84 remaining) [2025-01-10 02:27:19,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 84 remaining) [2025-01-10 02:27:19,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 84 remaining) [2025-01-10 02:27:19,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 84 remaining) [2025-01-10 02:27:19,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 84 remaining) [2025-01-10 02:27:19,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 84 remaining) [2025-01-10 02:27:19,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 84 remaining) [2025-01-10 02:27:19,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 84 remaining) [2025-01-10 02:27:19,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 84 remaining) [2025-01-10 02:27:19,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 84 remaining) [2025-01-10 02:27:19,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 84 remaining) [2025-01-10 02:27:19,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 84 remaining) [2025-01-10 02:27:19,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 84 remaining) [2025-01-10 02:27:19,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 84 remaining) [2025-01-10 02:27:19,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 84 remaining) [2025-01-10 02:27:19,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 84 remaining) [2025-01-10 02:27:19,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 84 remaining) [2025-01-10 02:27:19,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 84 remaining) [2025-01-10 02:27:19,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 84 remaining) [2025-01-10 02:27:19,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 84 remaining) [2025-01-10 02:27:19,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 84 remaining) [2025-01-10 02:27:19,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 84 remaining) [2025-01-10 02:27:19,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 84 remaining) [2025-01-10 02:27:19,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 84 remaining) [2025-01-10 02:27:19,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 84 remaining) [2025-01-10 02:27:19,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 84 remaining) [2025-01-10 02:27:19,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 84 remaining) [2025-01-10 02:27:19,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 84 remaining) [2025-01-10 02:27:19,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 84 remaining) [2025-01-10 02:27:19,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 84 remaining) [2025-01-10 02:27:19,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 84 remaining) [2025-01-10 02:27:19,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 84 remaining) [2025-01-10 02:27:19,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 84 remaining) [2025-01-10 02:27:19,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 84 remaining) [2025-01-10 02:27:19,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 84 remaining) [2025-01-10 02:27:19,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 84 remaining) [2025-01-10 02:27:19,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 84 remaining) [2025-01-10 02:27:19,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 84 remaining) [2025-01-10 02:27:19,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 84 remaining) [2025-01-10 02:27:19,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 84 remaining) [2025-01-10 02:27:19,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 84 remaining) [2025-01-10 02:27:19,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 84 remaining) [2025-01-10 02:27:19,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 84 remaining) [2025-01-10 02:27:19,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 84 remaining) [2025-01-10 02:27:19,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 84 remaining) [2025-01-10 02:27:19,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 84 remaining) [2025-01-10 02:27:19,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 84 remaining) [2025-01-10 02:27:19,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 84 remaining) [2025-01-10 02:27:19,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 84 remaining) [2025-01-10 02:27:19,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 84 remaining) [2025-01-10 02:27:19,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 84 remaining) [2025-01-10 02:27:19,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 84 remaining) [2025-01-10 02:27:19,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 84 remaining) [2025-01-10 02:27:19,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 84 remaining) [2025-01-10 02:27:19,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 84 remaining) [2025-01-10 02:27:19,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 84 remaining) [2025-01-10 02:27:19,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 84 remaining) [2025-01-10 02:27:19,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 84 remaining) [2025-01-10 02:27:19,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 84 remaining) [2025-01-10 02:27:19,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-01-10 02:27:19,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-01-10 02:27:19,806 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:27:19,816 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 02:27:19,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:27:19 BoogieIcfgContainer [2025-01-10 02:27:19,818 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 02:27:19,818 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 02:27:19,818 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 02:27:19,818 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 02:27:19,819 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:26:07" (3/4) ... [2025-01-10 02:27:19,820 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 02:27:19,820 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 02:27:19,821 INFO L158 Benchmark]: Toolchain (without parser) took 72676.86ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 124.2MB in the beginning and 225.9MB in the end (delta: -101.7MB). Peak memory consumption was 129.1MB. Max. memory is 16.1GB. [2025-01-10 02:27:19,821 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:27:19,821 INFO L158 Benchmark]: CACSL2BoogieTranslator took 147.82ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 112.5MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:27:19,821 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.54ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 111.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:27:19,821 INFO L158 Benchmark]: Boogie Preprocessor took 36.76ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 109.4MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:27:19,821 INFO L158 Benchmark]: RCFGBuilder took 488.54ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 80.5MB in the end (delta: 28.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 02:27:19,821 INFO L158 Benchmark]: TraceAbstraction took 71958.17ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 79.8MB in the beginning and 225.9MB in the end (delta: -146.2MB). Peak memory consumption was 87.2MB. Max. memory is 16.1GB. [2025-01-10 02:27:19,821 INFO L158 Benchmark]: Witness Printer took 2.31ms. Allocated memory is still 402.7MB. Free memory was 225.9MB in the beginning and 225.9MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:27:19,822 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.21ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 147.82ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 112.5MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.54ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 111.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.76ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 109.4MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 488.54ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 80.5MB in the end (delta: 28.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 71958.17ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 79.8MB in the beginning and 225.9MB in the end (delta: -146.2MB). Peak memory consumption was 87.2MB. Max. memory is 16.1GB. * Witness Printer took 2.31ms. Allocated memory is still 402.7MB. Free memory was 225.9MB in the beginning and 225.9MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L18] short k; [L19] long long y, x, c; [L20] k = __VERIFIER_nondet_short() [L21] CALL assume_abort_if_not(k>=0 && k<=10) [L7] COND FALSE !(!cond) [L21] RET assume_abort_if_not(k>=0 && k<=10) [L22] CALL assume_abort_if_not(k <= 256) [L7] COND FALSE !(!cond) [L22] RET assume_abort_if_not(k <= 256) [L24] y = 0 [L25] x = 0 [L26] c = 0 [L29] EXPR 6*y [L29] EXPR 6*y*y [L29] EXPR 6*y*y*y [L29] EXPR 6*y*y*y*y [L29] EXPR 6*y*y*y*y*y [L29] EXPR 15*y [L29] EXPR 15*y*y [L29] EXPR 15*y*y*y [L29] EXPR 15*y*y*y*y [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y [L29] EXPR 10*y [L29] EXPR 10*y*y [L29] EXPR 10*y*y*y [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y [L29] EXPR 30*x [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y [L29] CALL __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L10] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L31] COND FALSE !(!(c < k)) [L34] EXPR c + 1 [L34] c = c + 1 [L35] EXPR y + 1 [L35] y = y + 1 [L36] EXPR y * y [L36] EXPR y * y * y [L36] EXPR y * y * y * y [L36] EXPR y * y * y * y + x [L36] x = y * y * y * y + x [L29] EXPR 6*y [L29] EXPR 6*y*y [L29] EXPR 6*y*y*y [L29] EXPR 6*y*y*y*y [L29] EXPR 6*y*y*y*y*y [L29] EXPR 15*y [L29] EXPR 15*y*y [L29] EXPR 15*y*y*y [L29] EXPR 15*y*y*y*y [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y [L29] EXPR 10*y [L29] EXPR 10*y*y [L29] EXPR 10*y*y*y [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y [L29] EXPR 30*x [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y [L29] CALL __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L10] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L31] COND FALSE !(!(c < k)) [L34] EXPR c + 1 [L34] c = c + 1 [L35] EXPR y + 1 [L35] y = y + 1 [L36] EXPR y * y [L36] EXPR y * y * y [L36] EXPR y * y * y * y [L36] EXPR y * y * y * y + x [L36] x = y * y * y * y + x [L29] EXPR 6*y [L29] EXPR 6*y*y [L29] EXPR 6*y*y*y [L29] EXPR 6*y*y*y*y [L29] EXPR 6*y*y*y*y*y [L29] EXPR 15*y [L29] EXPR 15*y*y [L29] EXPR 15*y*y*y [L29] EXPR 15*y*y*y*y [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y [L29] EXPR 10*y [L29] EXPR 10*y*y [L29] EXPR 10*y*y*y [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y [L29] EXPR 30*x [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y [L29] CALL __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L10] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L31] COND FALSE !(!(c < k)) [L34] EXPR c + 1 [L34] c = c + 1 [L35] EXPR y + 1 [L35] y = y + 1 [L36] EXPR y * y [L36] EXPR y * y * y [L36] EXPR y * y * y * y [L36] EXPR y * y * y * y + x [L36] x = y * y * y * y + x [L29] EXPR 6*y [L29] EXPR 6*y*y [L29] EXPR 6*y*y*y [L29] EXPR 6*y*y*y*y [L29] EXPR 6*y*y*y*y*y [L29] EXPR 15*y [L29] EXPR 15*y*y [L29] EXPR 15*y*y*y [L29] EXPR 15*y*y*y*y [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y [L29] EXPR 10*y [L29] EXPR 10*y*y [L29] EXPR 10*y*y*y [L29] 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y [L29] 30*x - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 191 locations, 84 error locations. Started 1 CEGAR loops. OverallTime: 71.9s, OverallIterations: 26, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 59.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 3344 SdHoareTripleChecker+Valid, 58.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3311 mSDsluCounter, 5106 SdHoareTripleChecker+Invalid, 57.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2983 mSDsCounter, 289 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8474 IncrementalHoareTripleChecker+Invalid, 8770 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 289 mSolverCounterUnsat, 2123 mSDtfsCounter, 8474 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3108 GetRequests, 2992 SyntacticMatches, 2 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=414occurred in iteration=24, InterpolantAutomatonStates: 131, 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, 25 MinimizatonAttempts, 420 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 4979 NumberOfCodeBlocks, 4830 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 3586 ConstructedInterpolants, 0 QuantifiedInterpolants, 26705 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2723 ConjunctsInSsa, 106 ConjunctsInUnsatCore, 35 InterpolantComputations, 17 PerfectInterpolantSequences, 812/1977 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-10 02:27:19,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/ps5-ll_valuebound10.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.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 4cd3813e1162515d6dfe6f021a67e8bd41b689ea28e27900ea441d7fd3bbe5cc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:27:21,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:27:21,765 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2025-01-10 02:27:21,773 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:27:21,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:27:21,800 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:27:21,800 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:27:21,800 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:27:21,801 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:27:21,801 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:27:21,801 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:27:21,801 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:27:21,801 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:27:21,801 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:27:21,801 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:27:21,801 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:27:21,801 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:27:21,801 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:27:21,801 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:27:21,801 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:27:21,801 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:27:21,802 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:27:21,802 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:27:21,802 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 02:27:21,802 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-10 02:27:21,802 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:27:21,802 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-10 02:27:21,802 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:27:21,802 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:27:21,802 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:27:21,802 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:27:21,802 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:27:21,802 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:27:21,802 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:27:21,802 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:27:21,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:27:21,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:27:21,802 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:27:21,802 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:27:21,802 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:27:21,803 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:27:21,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:27:21,803 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:27:21,803 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:27:21,803 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:27:21,803 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:27:21,803 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-10 02:27:21,803 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-10 02:27:21,803 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:27:21,803 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:27:21,803 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:27:21,803 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:27:21,803 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 -> 4cd3813e1162515d6dfe6f021a67e8bd41b689ea28e27900ea441d7fd3bbe5cc [2025-01-10 02:27:22,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:27:22,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:27:22,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:27:22,055 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:27:22,056 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:27:22,057 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound10.c [2025-01-10 02:27:23,241 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/317ddae92/ee578d56075a4e279d9bdd9ba8d991eb/FLAGe5bd7e0d9 [2025-01-10 02:27:23,402 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:27:23,404 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound10.c [2025-01-10 02:27:23,408 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/317ddae92/ee578d56075a4e279d9bdd9ba8d991eb/FLAGe5bd7e0d9 [2025-01-10 02:27:23,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/317ddae92/ee578d56075a4e279d9bdd9ba8d991eb [2025-01-10 02:27:23,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:27:23,799 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:27:23,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:27:23,802 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:27:23,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:27:23,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:27:23" (1/1) ... [2025-01-10 02:27:23,806 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b33e66d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:27:23, skipping insertion in model container [2025-01-10 02:27:23,807 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:27:23" (1/1) ... [2025-01-10 02:27:23,818 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:27:23,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:27:23,945 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:27:23,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:27:23,974 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:27:23,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:27:23 WrapperNode [2025-01-10 02:27:23,974 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:27:23,975 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:27:23,975 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:27:23,975 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:27:23,979 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:23" (1/1) ... [2025-01-10 02:27:23,985 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:23" (1/1) ... [2025-01-10 02:27:24,007 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 122 [2025-01-10 02:27:24,007 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:27:24,008 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:27:24,008 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:27:24,008 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:27:24,020 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:23" (1/1) ... [2025-01-10 02:27:24,021 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:23" (1/1) ... [2025-01-10 02:27:24,022 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:23" (1/1) ... [2025-01-10 02:27:24,029 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:24,029 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:23" (1/1) ... [2025-01-10 02:27:24,029 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:23" (1/1) ... [2025-01-10 02:27:24,034 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:23" (1/1) ... [2025-01-10 02:27:24,035 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:23" (1/1) ... [2025-01-10 02:27:24,037 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:23" (1/1) ... [2025-01-10 02:27:24,038 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:23" (1/1) ... [2025-01-10 02:27:24,038 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:23" (1/1) ... [2025-01-10 02:27:24,040 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:27:24,040 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:27:24,040 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:27:24,040 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:27:24,041 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:27:23" (1/1) ... [2025-01-10 02:27:24,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:27:24,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:27:24,063 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:24,065 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:24,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:27:24,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-10 02:27:24,080 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 02:27:24,080 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 02:27:24,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:27:24,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:27:24,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 02:27:24,080 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 02:27:24,120 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:27:24,129 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation