./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound1.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/cohencu-ll_unwindbound1.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 6b537bfce1176c41c6bc215444effcd63b1e343cf1b15ee69a282ebedb146c69 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:52:54,327 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:52:54,384 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 01:52:54,388 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:52:54,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:52:54,414 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:52:54,415 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:52:54,415 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:52:54,415 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:52:54,416 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:52:54,416 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:52:54,417 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:52:54,417 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:52:54,417 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:52:54,417 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:52:54,417 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:52:54,417 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:52:54,418 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:52:54,418 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:52:54,418 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:52:54,418 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:52:54,418 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:52:54,418 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:52:54,418 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:52:54,418 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:52:54,419 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:52:54,419 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:52:54,419 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:52:54,419 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:52:54,419 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:52:54,419 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:52:54,419 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:52:54,419 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:52:54,419 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:52:54,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:52:54,419 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:52:54,420 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:52:54,420 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:52:54,420 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:52:54,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:52:54,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:52:54,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:52:54,420 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:52:54,420 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:52:54,421 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:52:54,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:52:54,421 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:52:54,421 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:52:54,421 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:52:54,421 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:52:54,421 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 -> 6b537bfce1176c41c6bc215444effcd63b1e343cf1b15ee69a282ebedb146c69 [2025-01-10 01:52:54,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:52:54,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:52:54,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:52:54,693 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:52:54,693 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:52:54,694 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound1.c [2025-01-10 01:52:55,852 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b0cbe92b/41c8ee69559043b0bf7c08a4308215f8/FLAG258eb4905 [2025-01-10 01:52:56,078 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:52:56,079 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound1.c [2025-01-10 01:52:56,086 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b0cbe92b/41c8ee69559043b0bf7c08a4308215f8/FLAG258eb4905 [2025-01-10 01:52:56,423 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b0cbe92b/41c8ee69559043b0bf7c08a4308215f8 [2025-01-10 01:52:56,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:52:56,426 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:52:56,429 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:52:56,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:52:56,433 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:52:56,433 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:52:56" (1/1) ... [2025-01-10 01:52:56,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e8dd874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:56, skipping insertion in model container [2025-01-10 01:52:56,434 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:52:56" (1/1) ... [2025-01-10 01:52:56,447 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:52:56,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:52:56,583 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:52:56,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:52:56,609 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:52:56,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:56 WrapperNode [2025-01-10 01:52:56,611 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:52:56,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:52:56,612 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:52:56,612 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:52:56,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:56" (1/1) ... [2025-01-10 01:52:56,622 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:56" (1/1) ... [2025-01-10 01:52:56,646 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 194 [2025-01-10 01:52:56,646 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:52:56,651 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:52:56,651 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:52:56,651 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:52:56,659 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:56" (1/1) ... [2025-01-10 01:52:56,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:56" (1/1) ... [2025-01-10 01:52:56,661 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:56" (1/1) ... [2025-01-10 01:52:56,679 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 01:52:56,680 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:56" (1/1) ... [2025-01-10 01:52:56,680 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:56" (1/1) ... [2025-01-10 01:52:56,683 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:56" (1/1) ... [2025-01-10 01:52:56,687 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:56" (1/1) ... [2025-01-10 01:52:56,689 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:56" (1/1) ... [2025-01-10 01:52:56,694 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:56" (1/1) ... [2025-01-10 01:52:56,695 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:56" (1/1) ... [2025-01-10 01:52:56,697 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:52:56,700 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:52:56,700 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:52:56,700 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:52:56,701 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:56" (1/1) ... [2025-01-10 01:52:56,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:52:56,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:52:56,731 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:52:56,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:52:56,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:52:56,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:52:56,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:52:56,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:52:56,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 01:52:56,750 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 01:52:56,800 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:52:56,801 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:52:57,375 INFO L? ?]: Removed 239 outVars from TransFormulas that were not future-live. [2025-01-10 01:52:57,375 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:52:57,385 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:52:57,386 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 01:52:57,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:52:57 BoogieIcfgContainer [2025-01-10 01:52:57,386 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:52:57,387 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:52:57,387 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:52:57,390 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:52:57,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:52:56" (1/3) ... [2025-01-10 01:52:57,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3989e797 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:52:57, skipping insertion in model container [2025-01-10 01:52:57,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:56" (2/3) ... [2025-01-10 01:52:57,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3989e797 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:52:57, skipping insertion in model container [2025-01-10 01:52:57,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:52:57" (3/3) ... [2025-01-10 01:52:57,392 INFO L128 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound1.c [2025-01-10 01:52:57,401 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:52:57,402 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cohencu-ll_unwindbound1.c that has 2 procedures, 306 locations, 1 initial locations, 1 loop locations, and 140 error locations. [2025-01-10 01:52:57,442 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:52:57,450 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;@4d5896dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:52:57,450 INFO L334 AbstractCegarLoop]: Starting to check reachability of 140 error locations. [2025-01-10 01:52:57,454 INFO L276 IsEmpty]: Start isEmpty. Operand has 306 states, 153 states have (on average 1.9411764705882353) internal successors, (297), 293 states have internal predecessors, (297), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 01:52:57,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 01:52:57,457 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:52:57,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 01:52:57,458 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-01-10 01:52:57,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:52:57,461 INFO L85 PathProgramCache]: Analyzing trace with hash 925636, now seen corresponding path program 1 times [2025-01-10 01:52:57,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:52:57,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936845454] [2025-01-10 01:52:57,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:52:57,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:52:57,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:52:57,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:52:57,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:52:57,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:52:57,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:52:57,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:52:57,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936845454] [2025-01-10 01:52:57,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936845454] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:52:57,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:52:57,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:52:57,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982753019] [2025-01-10 01:52:57,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:52:57,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:52:57,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:52:57,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:52:57,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:52:57,599 INFO L87 Difference]: Start difference. First operand has 306 states, 153 states have (on average 1.9411764705882353) internal successors, (297), 293 states have internal predecessors, (297), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:52:57,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:52:57,657 INFO L93 Difference]: Finished difference Result 601 states and 646 transitions. [2025-01-10 01:52:57,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:52:57,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-10 01:52:57,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:52:57,664 INFO L225 Difference]: With dead ends: 601 [2025-01-10 01:52:57,664 INFO L226 Difference]: Without dead ends: 291 [2025-01-10 01:52:57,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:52:57,669 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 307 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:52:57,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 602 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:52:57,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-01-10 01:52:57,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2025-01-10 01:52:57,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 148 states have (on average 1.8986486486486487) internal successors, (281), 279 states have internal predecessors, (281), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 01:52:57,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 301 transitions. [2025-01-10 01:52:57,704 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 301 transitions. Word has length 4 [2025-01-10 01:52:57,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:52:57,704 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 301 transitions. [2025-01-10 01:52:57,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:52:57,705 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 301 transitions. [2025-01-10 01:52:57,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 01:52:57,705 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:52:57,705 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 01:52:57,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:52:57,705 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-01-10 01:52:57,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:52:57,706 INFO L85 PathProgramCache]: Analyzing trace with hash 28694756, now seen corresponding path program 1 times [2025-01-10 01:52:57,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:52:57,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996004550] [2025-01-10 01:52:57,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:52:57,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:52:57,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:52:57,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:52:57,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:52:57,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:52:57,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:52:57,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:52:57,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996004550] [2025-01-10 01:52:57,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996004550] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:52:57,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:52:57,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:52:57,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386277261] [2025-01-10 01:52:57,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:52:57,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:52:57,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:52:57,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:52:57,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:52:57,743 INFO L87 Difference]: Start difference. First operand 291 states and 301 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:52:57,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:52:57,775 INFO L93 Difference]: Finished difference Result 471 states and 485 transitions. [2025-01-10 01:52:57,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:52:57,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-10 01:52:57,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:52:57,777 INFO L225 Difference]: With dead ends: 471 [2025-01-10 01:52:57,777 INFO L226 Difference]: Without dead ends: 295 [2025-01-10 01:52:57,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:52:57,778 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 3 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:52:57,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 887 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:52:57,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-01-10 01:52:57,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2025-01-10 01:52:57,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 152 states have (on average 1.875) internal successors, (285), 283 states have internal predecessors, (285), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 01:52:57,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 305 transitions. [2025-01-10 01:52:57,816 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 305 transitions. Word has length 5 [2025-01-10 01:52:57,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:52:57,816 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 305 transitions. [2025-01-10 01:52:57,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:52:57,816 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 305 transitions. [2025-01-10 01:52:57,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:52:57,816 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:52:57,816 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:52:57,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:52:57,816 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-01-10 01:52:57,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:52:57,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1805858121, now seen corresponding path program 1 times [2025-01-10 01:52:57,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:52:57,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095927899] [2025-01-10 01:52:57,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:52:57,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:52:57,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:52:57,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:52:57,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:52:57,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:52:57,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:52:57,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:52:57,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095927899] [2025-01-10 01:52:57,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095927899] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:52:57,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:52:57,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:52:57,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718848790] [2025-01-10 01:52:57,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:52:57,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:52:57,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:52:57,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:52:57,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:52:57,853 INFO L87 Difference]: Start difference. First operand 295 states and 305 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:52:57,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:52:57,972 INFO L93 Difference]: Finished difference Result 563 states and 583 transitions. [2025-01-10 01:52:57,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:52:57,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-10 01:52:57,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:52:57,974 INFO L225 Difference]: With dead ends: 563 [2025-01-10 01:52:57,974 INFO L226 Difference]: Without dead ends: 543 [2025-01-10 01:52:57,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:52:57,975 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 237 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:52:57,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 596 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:52:57,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-01-10 01:52:57,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 353. [2025-01-10 01:52:57,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 205 states have (on average 1.7853658536585366) internal successors, (366), 336 states have internal predecessors, (366), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-10 01:52:57,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 396 transitions. [2025-01-10 01:52:57,991 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 396 transitions. Word has length 7 [2025-01-10 01:52:57,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:52:57,991 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 396 transitions. [2025-01-10 01:52:57,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:52:57,992 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 396 transitions. [2025-01-10 01:52:57,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-10 01:52:57,992 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:52:57,992 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:52:57,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:52:57,993 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-01-10 01:52:57,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:52:57,993 INFO L85 PathProgramCache]: Analyzing trace with hash -633270809, now seen corresponding path program 1 times [2025-01-10 01:52:57,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:52:57,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020268847] [2025-01-10 01:52:57,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:52:57,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:52:58,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-10 01:52:58,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 01:52:58,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:52:58,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 01:52:58,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [856027838] [2025-01-10 01:52:58,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:52:58,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:52:58,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:52:58,033 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:52:58,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:52:58,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-10 01:52:58,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 01:52:58,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:52:58,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:52:58,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:52:58,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:52:58,187 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:52:58,188 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:52:58,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:52:58,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020268847] [2025-01-10 01:52:58,188 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 01:52:58,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856027838] [2025-01-10 01:52:58,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856027838] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:52:58,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:52:58,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:52:58,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350300035] [2025-01-10 01:52:58,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:52:58,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:52:58,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:52:58,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:52:58,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:52:58,190 INFO L87 Difference]: Start difference. First operand 353 states and 396 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 01:52:58,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:52:58,564 INFO L93 Difference]: Finished difference Result 513 states and 571 transitions. [2025-01-10 01:52:58,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:52:58,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2025-01-10 01:52:58,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:52:58,567 INFO L225 Difference]: With dead ends: 513 [2025-01-10 01:52:58,567 INFO L226 Difference]: Without dead ends: 458 [2025-01-10 01:52:58,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:52:58,568 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 134 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 01:52:58,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 329 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 01:52:58,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-01-10 01:52:58,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 438. [2025-01-10 01:52:58,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 285 states have (on average 1.6456140350877193) internal successors, (469), 416 states have internal predecessors, (469), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-10 01:52:58,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 509 transitions. [2025-01-10 01:52:58,582 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 509 transitions. Word has length 40 [2025-01-10 01:52:58,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:52:58,583 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 509 transitions. [2025-01-10 01:52:58,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 01:52:58,583 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 509 transitions. [2025-01-10 01:52:58,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-10 01:52:58,583 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:52:58,583 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:52:58,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:52:58,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:52:58,788 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-01-10 01:52:58,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:52:58,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1312111433, now seen corresponding path program 1 times [2025-01-10 01:52:58,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:52:58,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204776715] [2025-01-10 01:52:58,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:52:58,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:52:58,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 01:52:58,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 01:52:58,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:52:58,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:52:58,877 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:52:58,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:52:58,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204776715] [2025-01-10 01:52:58,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204776715] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:52:58,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:52:58,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:52:58,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297071132] [2025-01-10 01:52:58,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:52:58,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:52:58,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:52:58,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:52:58,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:52:58,878 INFO L87 Difference]: Start difference. First operand 438 states and 509 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 01:52:59,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:52:59,103 INFO L93 Difference]: Finished difference Result 471 states and 516 transitions. [2025-01-10 01:52:59,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:52:59,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2025-01-10 01:52:59,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:52:59,106 INFO L225 Difference]: With dead ends: 471 [2025-01-10 01:52:59,106 INFO L226 Difference]: Without dead ends: 448 [2025-01-10 01:52:59,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:52:59,106 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 120 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:52:59,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 434 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:52:59,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-01-10 01:52:59,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 438. [2025-01-10 01:52:59,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 285 states have (on average 1.5649122807017544) internal successors, (446), 416 states have internal predecessors, (446), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-10 01:52:59,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 486 transitions. [2025-01-10 01:52:59,118 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 486 transitions. Word has length 42 [2025-01-10 01:52:59,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:52:59,119 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 486 transitions. [2025-01-10 01:52:59,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 01:52:59,119 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 486 transitions. [2025-01-10 01:52:59,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-10 01:52:59,119 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:52:59,120 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:52:59,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:52:59,120 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-01-10 01:52:59,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:52:59,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1781294933, now seen corresponding path program 1 times [2025-01-10 01:52:59,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:52:59,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202141656] [2025-01-10 01:52:59,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:52:59,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:52:59,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 01:52:59,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 01:52:59,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:52:59,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:52:59,194 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:52:59,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:52:59,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202141656] [2025-01-10 01:52:59,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202141656] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:52:59,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:52:59,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:52:59,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827046522] [2025-01-10 01:52:59,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:52:59,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:52:59,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:52:59,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:52:59,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:52:59,196 INFO L87 Difference]: Start difference. First operand 438 states and 486 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 01:52:59,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:52:59,742 INFO L93 Difference]: Finished difference Result 450 states and 493 transitions. [2025-01-10 01:52:59,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:52:59,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-01-10 01:52:59,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:52:59,744 INFO L225 Difference]: With dead ends: 450 [2025-01-10 01:52:59,744 INFO L226 Difference]: Without dead ends: 448 [2025-01-10 01:52:59,745 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 01:52:59,745 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 140 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 01:52:59,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 518 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 01:52:59,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-01-10 01:52:59,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 438. [2025-01-10 01:52:59,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 285 states have (on average 1.5578947368421052) internal successors, (444), 416 states have internal predecessors, (444), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-10 01:52:59,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 484 transitions. [2025-01-10 01:52:59,755 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 484 transitions. Word has length 44 [2025-01-10 01:52:59,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:52:59,756 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 484 transitions. [2025-01-10 01:52:59,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 01:52:59,756 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 484 transitions. [2025-01-10 01:52:59,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-10 01:52:59,756 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:52:59,756 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:52:59,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:52:59,757 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-01-10 01:52:59,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:52:59,757 INFO L85 PathProgramCache]: Analyzing trace with hash 614432022, now seen corresponding path program 1 times [2025-01-10 01:52:59,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:52:59,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821030878] [2025-01-10 01:52:59,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:52:59,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:52:59,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-10 01:52:59,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 01:52:59,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:52:59,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:52:59,833 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:52:59,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:52:59,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821030878] [2025-01-10 01:52:59,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821030878] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:52:59,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:52:59,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:52:59,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899309900] [2025-01-10 01:52:59,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:52:59,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:52:59,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:52:59,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:52:59,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:52:59,835 INFO L87 Difference]: Start difference. First operand 438 states and 484 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 01:53:00,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:53:00,114 INFO L93 Difference]: Finished difference Result 450 states and 491 transitions. [2025-01-10 01:53:00,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:53:00,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2025-01-10 01:53:00,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:53:00,116 INFO L225 Difference]: With dead ends: 450 [2025-01-10 01:53:00,116 INFO L226 Difference]: Without dead ends: 448 [2025-01-10 01:53:00,116 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 01:53:00,116 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 255 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 01:53:00,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 472 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 01:53:00,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-01-10 01:53:00,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 438. [2025-01-10 01:53:00,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 285 states have (on average 1.550877192982456) internal successors, (442), 416 states have internal predecessors, (442), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-10 01:53:00,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 482 transitions. [2025-01-10 01:53:00,149 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 482 transitions. Word has length 45 [2025-01-10 01:53:00,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:53:00,149 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 482 transitions. [2025-01-10 01:53:00,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 01:53:00,149 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 482 transitions. [2025-01-10 01:53:00,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-10 01:53:00,150 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:53:00,150 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:53:00,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:53:00,151 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-01-10 01:53:00,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:53:00,151 INFO L85 PathProgramCache]: Analyzing trace with hash -606149777, now seen corresponding path program 1 times [2025-01-10 01:53:00,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:53:00,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399013087] [2025-01-10 01:53:00,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:00,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:53:00,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 01:53:00,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 01:53:00,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:00,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 01:53:00,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [101025447] [2025-01-10 01:53:00,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:00,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:53:00,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:53:00,179 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:53:00,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:53:00,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 01:53:00,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 01:53:00,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:00,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:53:00,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:53:00,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:53:00,384 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:53:00,384 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:53:00,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:53:00,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399013087] [2025-01-10 01:53:00,384 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 01:53:00,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101025447] [2025-01-10 01:53:00,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101025447] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:53:00,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:53:00,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:53:00,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755082191] [2025-01-10 01:53:00,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:53:00,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:53:00,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:53:00,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:53:00,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:53:00,386 INFO L87 Difference]: Start difference. First operand 438 states and 482 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 01:53:00,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:53:00,740 INFO L93 Difference]: Finished difference Result 455 states and 489 transitions. [2025-01-10 01:53:00,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:53:00,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-01-10 01:53:00,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:53:00,743 INFO L225 Difference]: With dead ends: 455 [2025-01-10 01:53:00,743 INFO L226 Difference]: Without dead ends: 446 [2025-01-10 01:53:00,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:53:00,744 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 112 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 01:53:00,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 338 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 01:53:00,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-01-10 01:53:00,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 441. [2025-01-10 01:53:00,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 288 states have (on average 1.5243055555555556) internal successors, (439), 419 states have internal predecessors, (439), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-10 01:53:00,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 479 transitions. [2025-01-10 01:53:00,763 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 479 transitions. Word has length 48 [2025-01-10 01:53:00,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:53:00,763 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 479 transitions. [2025-01-10 01:53:00,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 01:53:00,763 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 479 transitions. [2025-01-10 01:53:00,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-10 01:53:00,767 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:53:00,767 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:53:00,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:53:00,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:53:00,968 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-01-10 01:53:00,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:53:00,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1610773798, now seen corresponding path program 1 times [2025-01-10 01:53:00,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:53:00,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999304968] [2025-01-10 01:53:00,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:00,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:53:00,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 01:53:00,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 01:53:00,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:00,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:53:01,094 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:53:01,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:53:01,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999304968] [2025-01-10 01:53:01,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999304968] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:53:01,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:53:01,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:53:01,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733366937] [2025-01-10 01:53:01,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:53:01,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:53:01,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:53:01,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:53:01,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:53:01,097 INFO L87 Difference]: Start difference. First operand 441 states and 479 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 01:53:01,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:53:01,409 INFO L93 Difference]: Finished difference Result 454 states and 480 transitions. [2025-01-10 01:53:01,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:53:01,410 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2025-01-10 01:53:01,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:53:01,411 INFO L225 Difference]: With dead ends: 454 [2025-01-10 01:53:01,411 INFO L226 Difference]: Without dead ends: 448 [2025-01-10 01:53:01,412 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 01:53:01,412 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 247 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 01:53:01,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 376 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 01:53:01,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-01-10 01:53:01,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 441. [2025-01-10 01:53:01,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 288 states have (on average 1.5034722222222223) internal successors, (433), 419 states have internal predecessors, (433), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-10 01:53:01,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 473 transitions. [2025-01-10 01:53:01,422 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 473 transitions. Word has length 49 [2025-01-10 01:53:01,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:53:01,423 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 473 transitions. [2025-01-10 01:53:01,423 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 01:53:01,423 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 473 transitions. [2025-01-10 01:53:01,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-10 01:53:01,423 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:53:01,423 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:53:01,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:53:01,423 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-01-10 01:53:01,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:53:01,424 INFO L85 PathProgramCache]: Analyzing trace with hash -27600738, now seen corresponding path program 1 times [2025-01-10 01:53:01,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:53:01,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991550237] [2025-01-10 01:53:01,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:01,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:53:01,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-10 01:53:01,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 01:53:01,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:01,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:53:01,538 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:53:01,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:53:01,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991550237] [2025-01-10 01:53:01,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991550237] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:53:01,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:53:01,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:53:01,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122906339] [2025-01-10 01:53:01,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:53:01,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:53:01,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:53:01,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:53:01,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:53:01,540 INFO L87 Difference]: Start difference. First operand 441 states and 473 transitions. Second operand has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 01:53:01,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:53:01,878 INFO L93 Difference]: Finished difference Result 452 states and 474 transitions. [2025-01-10 01:53:01,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:53:01,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2025-01-10 01:53:01,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:53:01,879 INFO L225 Difference]: With dead ends: 452 [2025-01-10 01:53:01,879 INFO L226 Difference]: Without dead ends: 379 [2025-01-10 01:53:01,880 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 01:53:01,880 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 226 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 01:53:01,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 316 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 01:53:01,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-01-10 01:53:01,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 375. [2025-01-10 01:53:01,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 225 states have (on average 1.6177777777777778) internal successors, (364), 356 states have internal predecessors, (364), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-10 01:53:01,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 398 transitions. [2025-01-10 01:53:01,888 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 398 transitions. Word has length 53 [2025-01-10 01:53:01,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:53:01,889 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 398 transitions. [2025-01-10 01:53:01,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 01:53:01,889 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 398 transitions. [2025-01-10 01:53:01,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-10 01:53:01,889 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:53:01,889 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:53:01,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:53:01,890 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-01-10 01:53:01,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:53:01,890 INFO L85 PathProgramCache]: Analyzing trace with hash -188580960, now seen corresponding path program 1 times [2025-01-10 01:53:01,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:53:01,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102315312] [2025-01-10 01:53:01,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:01,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:53:01,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-10 01:53:01,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 01:53:01,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:01,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:53:01,953 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 01:53:01,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:53:01,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102315312] [2025-01-10 01:53:01,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102315312] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:53:01,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:53:01,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:53:01,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801552772] [2025-01-10 01:53:01,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:53:01,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:53:01,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:53:01,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:53:01,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:53:01,955 INFO L87 Difference]: Start difference. First operand 375 states and 398 transitions. Second operand has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-10 01:53:02,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:53:02,195 INFO L93 Difference]: Finished difference Result 375 states and 398 transitions. [2025-01-10 01:53:02,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:53:02,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 85 [2025-01-10 01:53:02,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:53:02,197 INFO L225 Difference]: With dead ends: 375 [2025-01-10 01:53:02,197 INFO L226 Difference]: Without dead ends: 368 [2025-01-10 01:53:02,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:53:02,197 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 140 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:53:02,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 158 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:53:02,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-01-10 01:53:02,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2025-01-10 01:53:02,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 225 states have (on average 1.5866666666666667) internal successors, (357), 349 states have internal predecessors, (357), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-10 01:53:02,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 391 transitions. [2025-01-10 01:53:02,206 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 391 transitions. Word has length 85 [2025-01-10 01:53:02,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:53:02,207 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 391 transitions. [2025-01-10 01:53:02,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-10 01:53:02,207 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 391 transitions. [2025-01-10 01:53:02,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-10 01:53:02,207 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:53:02,208 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:53:02,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:53:02,208 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-01-10 01:53:02,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:53:02,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1551042300, now seen corresponding path program 1 times [2025-01-10 01:53:02,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:53:02,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116470165] [2025-01-10 01:53:02,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:02,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:53:02,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-10 01:53:02,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-10 01:53:02,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:02,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:53:02,276 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 01:53:02,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:53:02,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116470165] [2025-01-10 01:53:02,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116470165] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:53:02,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:53:02,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:53:02,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045003492] [2025-01-10 01:53:02,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:53:02,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:53:02,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:53:02,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:53:02,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:53:02,278 INFO L87 Difference]: Start difference. First operand 368 states and 391 transitions. Second operand has 3 states, 2 states have (on average 32.0) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-10 01:53:02,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:53:02,478 INFO L93 Difference]: Finished difference Result 375 states and 394 transitions. [2025-01-10 01:53:02,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:53:02,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 32.0) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 86 [2025-01-10 01:53:02,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:53:02,481 INFO L225 Difference]: With dead ends: 375 [2025-01-10 01:53:02,481 INFO L226 Difference]: Without dead ends: 374 [2025-01-10 01:53:02,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:53:02,481 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 24 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:53:02,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 409 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:53:02,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-01-10 01:53:02,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 370. [2025-01-10 01:53:02,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 227 states have (on average 1.5814977973568283) internal successors, (359), 351 states have internal predecessors, (359), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-10 01:53:02,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 393 transitions. [2025-01-10 01:53:02,491 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 393 transitions. Word has length 86 [2025-01-10 01:53:02,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:53:02,492 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 393 transitions. [2025-01-10 01:53:02,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 32.0) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-10 01:53:02,493 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 393 transitions. [2025-01-10 01:53:02,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-10 01:53:02,493 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:53:02,495 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:53:02,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:53:02,495 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-01-10 01:53:02,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:53:02,496 INFO L85 PathProgramCache]: Analyzing trace with hash 11485931, now seen corresponding path program 1 times [2025-01-10 01:53:02,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:53:02,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10137524] [2025-01-10 01:53:02,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:02,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:53:02,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-10 01:53:02,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-10 01:53:02,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:02,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:53:02,583 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:53:02,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:53:02,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10137524] [2025-01-10 01:53:02,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10137524] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:53:02,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:53:02,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:53:02,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999812351] [2025-01-10 01:53:02,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:53:02,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:53:02,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:53:02,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:53:02,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:53:02,585 INFO L87 Difference]: Start difference. First operand 370 states and 393 transitions. Second operand has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-10 01:53:02,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:53:02,643 INFO L93 Difference]: Finished difference Result 370 states and 393 transitions. [2025-01-10 01:53:02,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:53:02,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 88 [2025-01-10 01:53:02,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:53:02,645 INFO L225 Difference]: With dead ends: 370 [2025-01-10 01:53:02,646 INFO L226 Difference]: Without dead ends: 368 [2025-01-10 01:53:02,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:53:02,646 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 194 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:53:02,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 266 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:53:02,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-01-10 01:53:02,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2025-01-10 01:53:02,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 227 states have (on average 1.5638766519823788) internal successors, (355), 349 states have internal predecessors, (355), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-10 01:53:02,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 389 transitions. [2025-01-10 01:53:02,655 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 389 transitions. Word has length 88 [2025-01-10 01:53:02,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:53:02,655 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 389 transitions. [2025-01-10 01:53:02,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-10 01:53:02,656 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 389 transitions. [2025-01-10 01:53:02,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-10 01:53:02,657 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:53:02,657 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:53:02,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:53:02,658 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-01-10 01:53:02,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:53:02,658 INFO L85 PathProgramCache]: Analyzing trace with hash 356064041, now seen corresponding path program 1 times [2025-01-10 01:53:02,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:53:02,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630498038] [2025-01-10 01:53:02,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:02,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:53:02,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-10 01:53:02,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-10 01:53:02,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:02,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:53:02,746 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:53:02,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:53:02,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630498038] [2025-01-10 01:53:02,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630498038] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:53:02,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:53:02,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:53:02,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775497646] [2025-01-10 01:53:02,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:53:02,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:53:02,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:53:02,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:53:02,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:53:02,750 INFO L87 Difference]: Start difference. First operand 368 states and 389 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 01:53:02,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:53:02,886 INFO L93 Difference]: Finished difference Result 372 states and 389 transitions. [2025-01-10 01:53:02,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:53:02,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 89 [2025-01-10 01:53:02,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:53:02,889 INFO L225 Difference]: With dead ends: 372 [2025-01-10 01:53:02,889 INFO L226 Difference]: Without dead ends: 368 [2025-01-10 01:53:02,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:53:02,889 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 34 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:53:02,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 777 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:53:02,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-01-10 01:53:02,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 366. [2025-01-10 01:53:02,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 225 states have (on average 1.56) internal successors, (351), 347 states have internal predecessors, (351), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-10 01:53:02,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 385 transitions. [2025-01-10 01:53:02,900 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 385 transitions. Word has length 89 [2025-01-10 01:53:02,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:53:02,900 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 385 transitions. [2025-01-10 01:53:02,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 01:53:02,900 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 385 transitions. [2025-01-10 01:53:02,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-10 01:53:02,901 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:53:02,901 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:53:02,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 01:53:02,902 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-01-10 01:53:02,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:53:02,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1842953118, now seen corresponding path program 1 times [2025-01-10 01:53:02,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:53:02,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188653333] [2025-01-10 01:53:02,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:02,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:53:02,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-10 01:53:02,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-10 01:53:02,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:02,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:53:02,983 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 01:53:02,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:53:02,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188653333] [2025-01-10 01:53:02,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188653333] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:53:02,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:53:02,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:53:02,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322790836] [2025-01-10 01:53:02,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:53:02,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:53:02,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:53:02,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:53:02,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:53:02,985 INFO L87 Difference]: Start difference. First operand 366 states and 385 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-10 01:53:03,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:53:03,039 INFO L93 Difference]: Finished difference Result 535 states and 557 transitions. [2025-01-10 01:53:03,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:53:03,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 89 [2025-01-10 01:53:03,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:53:03,042 INFO L225 Difference]: With dead ends: 535 [2025-01-10 01:53:03,042 INFO L226 Difference]: Without dead ends: 534 [2025-01-10 01:53:03,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:53:03,043 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 229 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:53:03,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1499 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:53:03,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-01-10 01:53:03,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 442. [2025-01-10 01:53:03,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 296 states have (on average 1.6283783783783783) internal successors, (482), 418 states have internal predecessors, (482), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-10 01:53:03,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 526 transitions. [2025-01-10 01:53:03,055 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 526 transitions. Word has length 89 [2025-01-10 01:53:03,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:53:03,055 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 526 transitions. [2025-01-10 01:53:03,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-10 01:53:03,055 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 526 transitions. [2025-01-10 01:53:03,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-10 01:53:03,056 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:53:03,056 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:53:03,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 01:53:03,056 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-01-10 01:53:03,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:53:03,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1551419065, now seen corresponding path program 1 times [2025-01-10 01:53:03,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:53:03,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462917364] [2025-01-10 01:53:03,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:03,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:53:03,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-10 01:53:03,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-10 01:53:03,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:03,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:53:03,108 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 01:53:03,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:53:03,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462917364] [2025-01-10 01:53:03,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462917364] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:53:03,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456961664] [2025-01-10 01:53:03,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:03,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:53:03,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:53:03,113 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:53:03,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:53:03,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-10 01:53:03,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-10 01:53:03,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:03,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:53:03,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:53:03,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:53:03,241 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 01:53:03,242 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:53:03,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456961664] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:53:03,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:53:03,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 01:53:03,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535155565] [2025-01-10 01:53:03,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:53:03,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:53:03,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:53:03,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:53:03,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:53:03,243 INFO L87 Difference]: Start difference. First operand 442 states and 526 transitions. Second operand has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-10 01:53:03,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:53:03,343 INFO L93 Difference]: Finished difference Result 444 states and 526 transitions. [2025-01-10 01:53:03,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:53:03,344 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 91 [2025-01-10 01:53:03,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:53:03,347 INFO L225 Difference]: With dead ends: 444 [2025-01-10 01:53:03,347 INFO L226 Difference]: Without dead ends: 436 [2025-01-10 01:53:03,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:53:03,347 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 255 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:53:03,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 375 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:53:03,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-01-10 01:53:03,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2025-01-10 01:53:03,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 296 states have (on average 1.5945945945945945) internal successors, (472), 410 states have internal predecessors, (472), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-10 01:53:03,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 516 transitions. [2025-01-10 01:53:03,358 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 516 transitions. Word has length 91 [2025-01-10 01:53:03,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:53:03,358 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 516 transitions. [2025-01-10 01:53:03,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-10 01:53:03,358 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 516 transitions. [2025-01-10 01:53:03,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-10 01:53:03,359 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:53:03,360 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:53:03,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:53:03,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:53:03,560 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-01-10 01:53:03,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:53:03,560 INFO L85 PathProgramCache]: Analyzing trace with hash -849350709, now seen corresponding path program 1 times [2025-01-10 01:53:03,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:53:03,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093152953] [2025-01-10 01:53:03,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:03,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:53:03,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-10 01:53:03,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-10 01:53:03,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:03,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:53:03,621 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 01:53:03,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:53:03,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093152953] [2025-01-10 01:53:03,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093152953] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:53:03,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329551122] [2025-01-10 01:53:03,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:03,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:53:03,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:53:03,623 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:53:03,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 01:53:03,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-10 01:53:03,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-10 01:53:03,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:03,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:53:03,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:53:03,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:53:03,741 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 01:53:03,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:53:03,853 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 01:53:03,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329551122] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:53:03,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:53:03,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 01:53:03,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676723602] [2025-01-10 01:53:03,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:53:03,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:53:03,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:53:03,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:53:03,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:53:03,854 INFO L87 Difference]: Start difference. First operand 434 states and 516 transitions. Second operand has 7 states, 6 states have (on average 31.666666666666668) internal successors, (190), 7 states have internal predecessors, (190), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-10 01:53:03,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:53:03,995 INFO L93 Difference]: Finished difference Result 779 states and 948 transitions. [2025-01-10 01:53:03,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:53:03,996 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 31.666666666666668) internal successors, (190), 7 states have internal predecessors, (190), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 92 [2025-01-10 01:53:03,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:53:03,999 INFO L225 Difference]: With dead ends: 779 [2025-01-10 01:53:03,999 INFO L226 Difference]: Without dead ends: 771 [2025-01-10 01:53:03,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:53:03,999 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 1026 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1043 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:53:04,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1043 Valid, 749 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:53:04,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2025-01-10 01:53:04,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 505. [2025-01-10 01:53:04,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 367 states have (on average 1.561307901907357) internal successors, (573), 476 states have internal predecessors, (573), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-10 01:53:04,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 627 transitions. [2025-01-10 01:53:04,016 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 627 transitions. Word has length 92 [2025-01-10 01:53:04,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:53:04,016 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 627 transitions. [2025-01-10 01:53:04,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 31.666666666666668) internal successors, (190), 7 states have internal predecessors, (190), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-10 01:53:04,016 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 627 transitions. [2025-01-10 01:53:04,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-10 01:53:04,017 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:53:04,017 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:53:04,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 01:53:04,221 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,SelfDestructingSolverStorable16 [2025-01-10 01:53:04,221 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-01-10 01:53:04,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:53:04,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1655904136, now seen corresponding path program 1 times [2025-01-10 01:53:04,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:53:04,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252947188] [2025-01-10 01:53:04,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:04,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:53:04,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-10 01:53:04,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-10 01:53:04,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:04,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:53:04,285 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-01-10 01:53:04,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:53:04,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252947188] [2025-01-10 01:53:04,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252947188] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:53:04,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:53:04,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:53:04,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251494386] [2025-01-10 01:53:04,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:53:04,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:53:04,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:53:04,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:53:04,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:53:04,287 INFO L87 Difference]: Start difference. First operand 505 states and 627 transitions. Second operand has 3 states, 2 states have (on average 35.5) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-10 01:53:04,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:53:04,335 INFO L93 Difference]: Finished difference Result 505 states and 627 transitions. [2025-01-10 01:53:04,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:53:04,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 35.5) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 101 [2025-01-10 01:53:04,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:53:04,337 INFO L225 Difference]: With dead ends: 505 [2025-01-10 01:53:04,337 INFO L226 Difference]: Without dead ends: 503 [2025-01-10 01:53:04,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:53:04,338 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 170 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:53:04,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 252 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:53:04,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-01-10 01:53:04,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2025-01-10 01:53:04,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 367 states have (on average 1.550408719346049) internal successors, (569), 474 states have internal predecessors, (569), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-10 01:53:04,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 623 transitions. [2025-01-10 01:53:04,349 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 623 transitions. Word has length 101 [2025-01-10 01:53:04,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:53:04,350 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 623 transitions. [2025-01-10 01:53:04,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 35.5) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-10 01:53:04,350 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 623 transitions. [2025-01-10 01:53:04,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-10 01:53:04,351 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:53:04,351 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:53:04,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 01:53:04,351 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-01-10 01:53:04,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:53:04,351 INFO L85 PathProgramCache]: Analyzing trace with hash 206579518, now seen corresponding path program 1 times [2025-01-10 01:53:04,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:53:04,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157632202] [2025-01-10 01:53:04,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:04,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:53:04,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-10 01:53:04,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-10 01:53:04,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:04,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 01:53:04,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [787166820] [2025-01-10 01:53:04,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:04,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:53:04,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:53:04,366 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:53:04,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 01:53:04,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-10 01:53:04,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-10 01:53:04,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:04,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:53:04,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:53:04,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:53:05,357 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:53:05,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:53:05,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:53:05,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157632202] [2025-01-10 01:53:05,675 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 01:53:05,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787166820] [2025-01-10 01:53:05,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787166820] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:53:05,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:53:05,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-01-10 01:53:05,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217027134] [2025-01-10 01:53:05,676 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-10 01:53:05,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:53:05,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:53:05,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:53:05,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:53:05,677 INFO L87 Difference]: Start difference. First operand 503 states and 623 transitions. Second operand has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 01:53:06,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:53:06,323 INFO L93 Difference]: Finished difference Result 714 states and 919 transitions. [2025-01-10 01:53:06,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:53:06,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 102 [2025-01-10 01:53:06,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:53:06,327 INFO L225 Difference]: With dead ends: 714 [2025-01-10 01:53:06,327 INFO L226 Difference]: Without dead ends: 708 [2025-01-10 01:53:06,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:53:06,328 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 193 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 01:53:06,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 448 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 01:53:06,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2025-01-10 01:53:06,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 652. [2025-01-10 01:53:06,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 506 states have (on average 1.6027667984189724) internal successors, (811), 614 states have internal predecessors, (811), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2025-01-10 01:53:06,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 885 transitions. [2025-01-10 01:53:06,347 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 885 transitions. Word has length 102 [2025-01-10 01:53:06,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:53:06,347 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 885 transitions. [2025-01-10 01:53:06,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 01:53:06,347 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 885 transitions. [2025-01-10 01:53:06,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-10 01:53:06,348 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:53:06,348 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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 01:53:06,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 01:53:06,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:53:06,549 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-01-10 01:53:06,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:53:06,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1194138392, now seen corresponding path program 1 times [2025-01-10 01:53:06,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:53:06,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258153370] [2025-01-10 01:53:06,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:06,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:53:06,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-10 01:53:06,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-10 01:53:06,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:06,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:53:06,619 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:53:06,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:53:06,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258153370] [2025-01-10 01:53:06,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258153370] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:53:06,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304167349] [2025-01-10 01:53:06,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:06,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:53:06,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:53:06,627 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:53:06,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 01:53:06,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-10 01:53:06,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-10 01:53:06,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:06,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:53:06,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:53:06,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:53:06,757 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 01:53:06,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:53:06,857 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:53:06,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304167349] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:53:06,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:53:06,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 6 [2025-01-10 01:53:06,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654010875] [2025-01-10 01:53:06,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:53:06,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:53:06,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:53:06,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:53:06,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:53:06,863 INFO L87 Difference]: Start difference. First operand 652 states and 885 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 2 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-10 01:53:06,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:53:06,898 INFO L93 Difference]: Finished difference Result 741 states and 920 transitions. [2025-01-10 01:53:06,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:53:06,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 2 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2025-01-10 01:53:06,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:53:06,899 INFO L225 Difference]: With dead ends: 741 [2025-01-10 01:53:06,899 INFO L226 Difference]: Without dead ends: 252 [2025-01-10 01:53:06,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 203 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:53:06,900 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 165 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:53:06,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 686 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:53:06,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-01-10 01:53:06,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2025-01-10 01:53:06,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 173 states have (on average 1.3815028901734103) internal successors, (239), 237 states have internal predecessors, (239), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 01:53:06,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 263 transitions. [2025-01-10 01:53:06,907 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 263 transitions. Word has length 103 [2025-01-10 01:53:06,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:53:06,907 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 263 transitions. [2025-01-10 01:53:06,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 2 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-10 01:53:06,907 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 263 transitions. [2025-01-10 01:53:06,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-10 01:53:06,908 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:53:06,908 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:53:06,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 01:53:07,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:53:07,112 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-01-10 01:53:07,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:53:07,112 INFO L85 PathProgramCache]: Analyzing trace with hash 2108997946, now seen corresponding path program 1 times [2025-01-10 01:53:07,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:53:07,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169290895] [2025-01-10 01:53:07,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:07,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:53:07,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-10 01:53:07,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-10 01:53:07,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:07,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 01:53:07,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [162904291] [2025-01-10 01:53:07,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:07,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:53:07,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:53:07,130 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:53:07,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 01:53:07,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-10 01:53:07,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-10 01:53:07,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:07,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:53:07,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 01:53:07,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:53:07,936 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:53:07,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:53:08,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:53:08,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169290895] [2025-01-10 01:53:08,159 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 01:53:08,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162904291] [2025-01-10 01:53:08,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162904291] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:53:08,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:53:08,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-01-10 01:53:08,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550883680] [2025-01-10 01:53:08,160 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-10 01:53:08,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:53:08,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:53:08,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:53:08,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:53:08,161 INFO L87 Difference]: Start difference. First operand 252 states and 263 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 01:53:08,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:53:08,531 INFO L93 Difference]: Finished difference Result 252 states and 263 transitions. [2025-01-10 01:53:08,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:53:08,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 103 [2025-01-10 01:53:08,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:53:08,533 INFO L225 Difference]: With dead ends: 252 [2025-01-10 01:53:08,533 INFO L226 Difference]: Without dead ends: 247 [2025-01-10 01:53:08,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:53:08,533 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 120 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 01:53:08,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 219 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 01:53:08,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-01-10 01:53:08,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2025-01-10 01:53:08,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 173 states have (on average 1.3526011560693643) internal successors, (234), 232 states have internal predecessors, (234), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 01:53:08,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 258 transitions. [2025-01-10 01:53:08,542 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 258 transitions. Word has length 103 [2025-01-10 01:53:08,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:53:08,542 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 258 transitions. [2025-01-10 01:53:08,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 01:53:08,543 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 258 transitions. [2025-01-10 01:53:08,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-10 01:53:08,543 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:53:08,543 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:53:08,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 01:53:08,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:53:08,748 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-01-10 01:53:08,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:53:08,749 INFO L85 PathProgramCache]: Analyzing trace with hash -870109387, now seen corresponding path program 1 times [2025-01-10 01:53:08,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:53:08,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539911362] [2025-01-10 01:53:08,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:08,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:53:08,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-10 01:53:08,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-10 01:53:08,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:08,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 01:53:08,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [153355221] [2025-01-10 01:53:08,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:08,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:53:08,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:53:08,777 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:53:08,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 01:53:08,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-10 01:53:08,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-10 01:53:08,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:08,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:53:08,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:53:08,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:53:08,964 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-10 01:53:08,964 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:53:08,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:53:08,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539911362] [2025-01-10 01:53:08,964 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 01:53:08,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153355221] [2025-01-10 01:53:08,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153355221] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:53:08,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:53:08,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:53:08,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522263695] [2025-01-10 01:53:08,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:53:08,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:53:08,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:53:08,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:53:08,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:53:08,965 INFO L87 Difference]: Start difference. First operand 247 states and 258 transitions. Second operand has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-10 01:53:09,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:53:09,128 INFO L93 Difference]: Finished difference Result 248 states and 258 transitions. [2025-01-10 01:53:09,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:53:09,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 105 [2025-01-10 01:53:09,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:53:09,129 INFO L225 Difference]: With dead ends: 248 [2025-01-10 01:53:09,129 INFO L226 Difference]: Without dead ends: 247 [2025-01-10 01:53:09,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 102 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 01:53:09,131 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 73 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:53:09,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 271 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:53:09,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-01-10 01:53:09,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2025-01-10 01:53:09,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 173 states have (on average 1.346820809248555) internal successors, (233), 232 states have internal predecessors, (233), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 01:53:09,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 257 transitions. [2025-01-10 01:53:09,139 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 257 transitions. Word has length 105 [2025-01-10 01:53:09,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:53:09,140 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 257 transitions. [2025-01-10 01:53:09,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-10 01:53:09,140 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 257 transitions. [2025-01-10 01:53:09,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-10 01:53:09,141 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:53:09,141 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:53:09,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 01:53:09,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:53:09,342 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-01-10 01:53:09,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:53:09,343 INFO L85 PathProgramCache]: Analyzing trace with hash 954427072, now seen corresponding path program 1 times [2025-01-10 01:53:09,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:53:09,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758950577] [2025-01-10 01:53:09,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:09,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:53:09,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-10 01:53:09,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-10 01:53:09,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:09,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 01:53:09,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [404457234] [2025-01-10 01:53:09,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:09,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:53:09,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:53:09,365 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:53:09,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 01:53:09,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-10 01:53:09,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-10 01:53:09,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:09,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:53:09,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:53:09,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:53:09,667 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:53:09,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:53:09,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:53:09,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758950577] [2025-01-10 01:53:09,806 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 01:53:09,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404457234] [2025-01-10 01:53:09,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404457234] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:53:09,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:53:09,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-01-10 01:53:09,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208947983] [2025-01-10 01:53:09,806 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-10 01:53:09,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:53:09,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:53:09,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:53:09,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:53:09,807 INFO L87 Difference]: Start difference. First operand 247 states and 257 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 01:53:10,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:53:10,181 INFO L93 Difference]: Finished difference Result 247 states and 257 transitions. [2025-01-10 01:53:10,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:53:10,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 104 [2025-01-10 01:53:10,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:53:10,182 INFO L225 Difference]: With dead ends: 247 [2025-01-10 01:53:10,182 INFO L226 Difference]: Without dead ends: 239 [2025-01-10 01:53:10,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:53:10,183 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 181 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 01:53:10,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 177 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 01:53:10,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-01-10 01:53:10,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2025-01-10 01:53:10,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 173 states have (on average 1.300578034682081) internal successors, (225), 224 states have internal predecessors, (225), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 01:53:10,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 249 transitions. [2025-01-10 01:53:10,199 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 249 transitions. Word has length 104 [2025-01-10 01:53:10,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:53:10,203 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 249 transitions. [2025-01-10 01:53:10,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 01:53:10,203 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 249 transitions. [2025-01-10 01:53:10,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-10 01:53:10,203 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:53:10,204 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:53:10,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 01:53:10,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:53:10,405 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-01-10 01:53:10,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:53:10,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1203587016, now seen corresponding path program 1 times [2025-01-10 01:53:10,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:53:10,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502534724] [2025-01-10 01:53:10,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:10,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:53:10,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-10 01:53:10,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-10 01:53:10,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:10,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 01:53:10,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [576927860] [2025-01-10 01:53:10,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:10,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:53:10,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:53:10,432 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:53:10,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 01:53:10,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-10 01:53:10,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-10 01:53:10,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:10,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:53:10,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:53:10,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:53:10,627 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-10 01:53:10,628 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:53:10,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:53:10,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502534724] [2025-01-10 01:53:10,628 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 01:53:10,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576927860] [2025-01-10 01:53:10,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576927860] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:53:10,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:53:10,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:53:10,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587137189] [2025-01-10 01:53:10,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:53:10,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:53:10,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:53:10,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:53:10,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:53:10,629 INFO L87 Difference]: Start difference. First operand 239 states and 249 transitions. Second operand has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-10 01:53:10,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:53:10,839 INFO L93 Difference]: Finished difference Result 240 states and 249 transitions. [2025-01-10 01:53:10,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:53:10,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 106 [2025-01-10 01:53:10,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:53:10,840 INFO L225 Difference]: With dead ends: 240 [2025-01-10 01:53:10,840 INFO L226 Difference]: Without dead ends: 219 [2025-01-10 01:53:10,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:53:10,841 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 20 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:53:10,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 299 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:53:10,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-01-10 01:53:10,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2025-01-10 01:53:10,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 155 states have (on average 1.3290322580645162) internal successors, (206), 206 states have internal predecessors, (206), 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 01:53:10,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 226 transitions. [2025-01-10 01:53:10,845 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 226 transitions. Word has length 106 [2025-01-10 01:53:10,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:53:10,846 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 226 transitions. [2025-01-10 01:53:10,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-10 01:53:10,846 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 226 transitions. [2025-01-10 01:53:10,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-10 01:53:10,846 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:53:10,846 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:53:10,852 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 01:53:11,051 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,SelfDestructingSolverStorable23 [2025-01-10 01:53:11,051 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-01-10 01:53:11,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:53:11,052 INFO L85 PathProgramCache]: Analyzing trace with hash -477531652, now seen corresponding path program 1 times [2025-01-10 01:53:11,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:53:11,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815055553] [2025-01-10 01:53:11,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:11,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:53:11,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-10 01:53:11,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-10 01:53:11,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:11,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 01:53:11,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [837373862] [2025-01-10 01:53:11,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:11,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:53:11,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:53:11,067 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 01:53:11,072 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 01:53:11,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-10 01:53:11,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-10 01:53:11,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:11,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:53:11,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:53:11,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:53:11,359 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:53:11,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:53:11,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:53:11,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815055553] [2025-01-10 01:53:11,542 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 01:53:11,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837373862] [2025-01-10 01:53:11,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837373862] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:53:11,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:53:11,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-01-10 01:53:11,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977831865] [2025-01-10 01:53:11,542 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-10 01:53:11,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:53:11,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:53:11,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:53:11,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:53:11,543 INFO L87 Difference]: Start difference. First operand 219 states and 226 transitions. Second operand has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 01:53:11,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:53:11,790 INFO L93 Difference]: Finished difference Result 219 states and 226 transitions. [2025-01-10 01:53:11,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:53:11,791 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 105 [2025-01-10 01:53:11,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:53:11,792 INFO L225 Difference]: With dead ends: 219 [2025-01-10 01:53:11,792 INFO L226 Difference]: Without dead ends: 204 [2025-01-10 01:53:11,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:53:11,792 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 80 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:53:11,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 189 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:53:11,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-01-10 01:53:11,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-01-10 01:53:11,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 155 states have (on average 1.232258064516129) internal successors, (191), 191 states have internal predecessors, (191), 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 01:53:11,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 211 transitions. [2025-01-10 01:53:11,797 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 211 transitions. Word has length 105 [2025-01-10 01:53:11,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:53:11,798 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 211 transitions. [2025-01-10 01:53:11,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 01:53:11,798 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 211 transitions. [2025-01-10 01:53:11,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-10 01:53:11,799 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:53:11,799 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:53:11,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-10 01:53:11,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-01-10 01:53:11,999 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-01-10 01:53:11,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:53:12,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1918579134, now seen corresponding path program 1 times [2025-01-10 01:53:12,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:53:12,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887863629] [2025-01-10 01:53:12,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:12,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:53:12,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-10 01:53:12,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-10 01:53:12,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:12,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 01:53:12,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [292504283] [2025-01-10 01:53:12,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:12,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:53:12,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:53:12,015 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 01:53:12,019 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 01:53:12,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-10 01:53:12,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-10 01:53:12,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:12,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:53:12,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 01:53:12,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:53:12,924 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:53:12,924 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:53:13,412 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:53:13,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:53:13,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887863629] [2025-01-10 01:53:13,413 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 01:53:13,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292504283] [2025-01-10 01:53:13,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292504283] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:53:13,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:53:13,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-01-10 01:53:13,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012463188] [2025-01-10 01:53:13,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 01:53:13,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:53:13,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:53:13,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:53:13,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:53:13,414 INFO L87 Difference]: Start difference. First operand 204 states and 211 transitions. Second operand has 10 states, 9 states have (on average 17.11111111111111) internal successors, (154), 10 states have internal predecessors, (154), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-10 01:53:14,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:53:14,346 INFO L93 Difference]: Finished difference Result 204 states and 211 transitions. [2025-01-10 01:53:14,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:53:14,346 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 17.11111111111111) internal successors, (154), 10 states have internal predecessors, (154), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 106 [2025-01-10 01:53:14,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:53:14,347 INFO L225 Difference]: With dead ends: 204 [2025-01-10 01:53:14,347 INFO L226 Difference]: Without dead ends: 185 [2025-01-10 01:53:14,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:53:14,348 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 336 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-10 01:53:14,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 161 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-10 01:53:14,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-01-10 01:53:14,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-01-10 01:53:14,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 147 states have (on average 1.1700680272108843) internal successors, (172), 172 states have internal predecessors, (172), 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 01:53:14,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 192 transitions. [2025-01-10 01:53:14,356 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 192 transitions. Word has length 106 [2025-01-10 01:53:14,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:53:14,356 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 192 transitions. [2025-01-10 01:53:14,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 17.11111111111111) internal successors, (154), 10 states have internal predecessors, (154), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-10 01:53:14,356 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 192 transitions. [2025-01-10 01:53:14,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-10 01:53:14,357 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:53:14,357 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:53:14,365 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 01:53:14,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:53:14,558 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-01-10 01:53:14,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:53:14,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1891248721, now seen corresponding path program 1 times [2025-01-10 01:53:14,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:53:14,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594666209] [2025-01-10 01:53:14,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:14,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:53:14,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-10 01:53:14,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-10 01:53:14,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:14,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:53:14,618 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-10 01:53:14,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:53:14,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594666209] [2025-01-10 01:53:14,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594666209] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:53:14,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477240762] [2025-01-10 01:53:14,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:14,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:53:14,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:53:14,622 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 01:53:14,623 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 01:53:14,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-10 01:53:14,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-10 01:53:14,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:14,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:53:14,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:53:14,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:53:14,824 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-10 01:53:14,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:53:14,952 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-10 01:53:14,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477240762] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:53:14,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:53:14,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 01:53:14,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529045697] [2025-01-10 01:53:14,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:53:14,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:53:14,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:53:14,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:53:14,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:53:14,954 INFO L87 Difference]: Start difference. First operand 185 states and 192 transitions. Second operand has 7 states, 6 states have (on average 39.666666666666664) internal successors, (238), 7 states have internal predecessors, (238), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2025-01-10 01:53:15,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:53:15,119 INFO L93 Difference]: Finished difference Result 185 states and 192 transitions. [2025-01-10 01:53:15,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:53:15,119 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 39.666666666666664) internal successors, (238), 7 states have internal predecessors, (238), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 124 [2025-01-10 01:53:15,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:53:15,120 INFO L225 Difference]: With dead ends: 185 [2025-01-10 01:53:15,120 INFO L226 Difference]: Without dead ends: 175 [2025-01-10 01:53:15,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:53:15,120 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 76 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:53:15,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 153 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:53:15,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-01-10 01:53:15,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-01-10 01:53:15,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 145 states have (on average 1.1172413793103448) internal successors, (162), 162 states have internal predecessors, (162), 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 01:53:15,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 182 transitions. [2025-01-10 01:53:15,128 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 182 transitions. Word has length 124 [2025-01-10 01:53:15,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:53:15,128 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 182 transitions. [2025-01-10 01:53:15,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 39.666666666666664) internal successors, (238), 7 states have internal predecessors, (238), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2025-01-10 01:53:15,128 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 182 transitions. [2025-01-10 01:53:15,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-10 01:53:15,130 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:53:15,130 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:53:15,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-10 01:53:15,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:53:15,331 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-01-10 01:53:15,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:53:15,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1500832012, now seen corresponding path program 1 times [2025-01-10 01:53:15,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:53:15,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384136976] [2025-01-10 01:53:15,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:15,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:53:15,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-10 01:53:15,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-10 01:53:15,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:15,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 01:53:15,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [726336771] [2025-01-10 01:53:15,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:15,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:53:15,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:53:15,365 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 01:53:15,367 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 01:53:15,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-10 01:53:15,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-10 01:53:15,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:15,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:53:15,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:53:15,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:53:15,696 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-10 01:53:15,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:53:15,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:53:15,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384136976] [2025-01-10 01:53:15,771 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 01:53:15,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726336771] [2025-01-10 01:53:15,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726336771] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:53:15,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:53:15,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-01-10 01:53:15,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781309083] [2025-01-10 01:53:15,771 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-10 01:53:15,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:53:15,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:53:15,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:53:15,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:53:15,772 INFO L87 Difference]: Start difference. First operand 175 states and 182 transitions. Second operand has 6 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-10 01:53:15,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:53:15,923 INFO L93 Difference]: Finished difference Result 175 states and 182 transitions. [2025-01-10 01:53:15,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:53:15,924 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 125 [2025-01-10 01:53:15,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:53:15,925 INFO L225 Difference]: With dead ends: 175 [2025-01-10 01:53:15,925 INFO L226 Difference]: Without dead ends: 167 [2025-01-10 01:53:15,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:53:15,925 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 98 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:53:15,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 207 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:53:15,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-01-10 01:53:15,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2025-01-10 01:53:15,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 145 states have (on average 1.0620689655172413) internal successors, (154), 154 states have internal predecessors, (154), 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 01:53:15,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 174 transitions. [2025-01-10 01:53:15,930 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 174 transitions. Word has length 125 [2025-01-10 01:53:15,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:53:15,930 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 174 transitions. [2025-01-10 01:53:15,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-10 01:53:15,930 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 174 transitions. [2025-01-10 01:53:15,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-10 01:53:15,931 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:53:15,931 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:53:15,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-01-10 01:53:16,135 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,SelfDestructingSolverStorable27 [2025-01-10 01:53:16,135 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-01-10 01:53:16,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:53:16,136 INFO L85 PathProgramCache]: Analyzing trace with hash -718847663, now seen corresponding path program 1 times [2025-01-10 01:53:16,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:53:16,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349417599] [2025-01-10 01:53:16,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:16,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:53:16,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-10 01:53:16,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-10 01:53:16,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:16,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:53:16,274 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-10 01:53:16,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:53:16,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349417599] [2025-01-10 01:53:16,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349417599] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:53:16,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421058862] [2025-01-10 01:53:16,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:16,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:53:16,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:53:16,276 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 01:53:16,278 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 01:53:16,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-10 01:53:16,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-10 01:53:16,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:16,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:53:16,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:53:16,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:53:16,834 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-10 01:53:16,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:53:16,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421058862] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:53:16,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:53:16,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2025-01-10 01:53:16,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682529720] [2025-01-10 01:53:16,931 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 01:53:16,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:53:16,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:53:16,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:53:16,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:53:16,932 INFO L87 Difference]: Start difference. First operand 167 states and 174 transitions. Second operand has 11 states, 10 states have (on average 18.4) internal successors, (184), 11 states have internal predecessors, (184), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-10 01:53:17,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:53:17,466 INFO L93 Difference]: Finished difference Result 167 states and 174 transitions. [2025-01-10 01:53:17,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:53:17,466 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 18.4) internal successors, (184), 11 states have internal predecessors, (184), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 126 [2025-01-10 01:53:17,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:53:17,467 INFO L225 Difference]: With dead ends: 167 [2025-01-10 01:53:17,467 INFO L226 Difference]: Without dead ends: 166 [2025-01-10 01:53:17,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2025-01-10 01:53:17,467 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 359 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 01:53:17,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 227 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 01:53:17,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-01-10 01:53:17,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2025-01-10 01:53:17,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 145 states have (on average 1.0551724137931036) internal successors, (153), 153 states have internal predecessors, (153), 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 01:53:17,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 173 transitions. [2025-01-10 01:53:17,481 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 173 transitions. Word has length 126 [2025-01-10 01:53:17,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:53:17,481 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 173 transitions. [2025-01-10 01:53:17,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 18.4) internal successors, (184), 11 states have internal predecessors, (184), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-10 01:53:17,481 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 173 transitions. [2025-01-10 01:53:17,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-10 01:53:17,482 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:53:17,482 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:53:17,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-10 01:53:17,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-01-10 01:53:17,683 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-01-10 01:53:17,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:53:17,683 INFO L85 PathProgramCache]: Analyzing trace with hash -2105739115, now seen corresponding path program 1 times [2025-01-10 01:53:17,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:53:17,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526066510] [2025-01-10 01:53:17,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:17,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:53:17,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-10 01:53:17,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-10 01:53:17,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:17,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 01:53:17,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1539791502] [2025-01-10 01:53:17,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:17,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:53:17,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:53:17,708 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 01:53:17,710 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 01:53:17,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-10 01:53:17,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-10 01:53:17,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:17,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:53:17,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:53:17,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:53:18,332 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-01-10 01:53:18,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:53:18,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:53:18,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526066510] [2025-01-10 01:53:18,388 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 01:53:18,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539791502] [2025-01-10 01:53:18,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539791502] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:53:18,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:53:18,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-01-10 01:53:18,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133809647] [2025-01-10 01:53:18,388 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-10 01:53:18,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:53:18,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:53:18,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:53:18,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:53:18,389 INFO L87 Difference]: Start difference. First operand 166 states and 173 transitions. Second operand has 9 states, 8 states have (on average 12.625) internal successors, (101), 9 states have internal predecessors, (101), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-10 01:53:18,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:53:18,735 INFO L93 Difference]: Finished difference Result 170 states and 177 transitions. [2025-01-10 01:53:18,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:53:18,735 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 12.625) internal successors, (101), 9 states have internal predecessors, (101), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 130 [2025-01-10 01:53:18,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:53:18,736 INFO L225 Difference]: With dead ends: 170 [2025-01-10 01:53:18,736 INFO L226 Difference]: Without dead ends: 161 [2025-01-10 01:53:18,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:53:18,737 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 102 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 01:53:18,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 326 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 01:53:18,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-01-10 01:53:18,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2025-01-10 01:53:18,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 144 states have (on average 1.0) internal successors, (144), 144 states have internal predecessors, (144), 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 01:53:18,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 164 transitions. [2025-01-10 01:53:18,743 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 164 transitions. Word has length 130 [2025-01-10 01:53:18,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:53:18,743 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 164 transitions. [2025-01-10 01:53:18,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 12.625) internal successors, (101), 9 states have internal predecessors, (101), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-10 01:53:18,743 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 164 transitions. [2025-01-10 01:53:18,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-01-10 01:53:18,744 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:53:18,744 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:53:18,752 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 01:53:18,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:53:18,945 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr128ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-01-10 01:53:18,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:53:18,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1687456204, now seen corresponding path program 1 times [2025-01-10 01:53:18,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:53:18,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606247450] [2025-01-10 01:53:18,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:18,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:53:18,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-10 01:53:18,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-10 01:53:18,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:18,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 01:53:18,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1155996106] [2025-01-10 01:53:18,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:53:18,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:53:18,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:53:18,971 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 01:53:18,975 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 01:53:19,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-10 01:53:19,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-10 01:53:19,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:53:19,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:53:19,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 01:53:19,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:53:19,523 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-10 01:53:19,523 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:53:19,789 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-10 01:53:19,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:53:19,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606247450] [2025-01-10 01:53:19,789 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 01:53:19,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155996106] [2025-01-10 01:53:19,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155996106] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:53:19,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:53:19,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-01-10 01:53:19,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569733258] [2025-01-10 01:53:19,789 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 01:53:19,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:53:19,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:53:19,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:53:19,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:53:19,790 INFO L87 Difference]: Start difference. First operand 157 states and 164 transitions. Second operand has 10 states, 9 states have (on average 30.88888888888889) internal successors, (278), 10 states have internal predecessors, (278), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-10 01:53:19,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:53:19,975 INFO L93 Difference]: Finished difference Result 157 states and 164 transitions. [2025-01-10 01:53:19,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:53:19,975 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 30.88888888888889) internal successors, (278), 10 states have internal predecessors, (278), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 188 [2025-01-10 01:53:19,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:53:19,975 INFO L225 Difference]: With dead ends: 157 [2025-01-10 01:53:19,976 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 01:53:19,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:53:19,976 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:53:19,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 271 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:53:19,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 01:53:19,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 01:53:19,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:53:19,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 01:53:19,977 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 188 [2025-01-10 01:53:19,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:53:19,977 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 01:53:19,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 30.88888888888889) internal successors, (278), 10 states have internal predecessors, (278), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-10 01:53:19,978 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 01:53:19,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 01:53:19,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (139 of 140 remaining) [2025-01-10 01:53:19,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (138 of 140 remaining) [2025-01-10 01:53:19,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (137 of 140 remaining) [2025-01-10 01:53:19,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (136 of 140 remaining) [2025-01-10 01:53:19,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (135 of 140 remaining) [2025-01-10 01:53:19,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (134 of 140 remaining) [2025-01-10 01:53:19,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (133 of 140 remaining) [2025-01-10 01:53:19,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (132 of 140 remaining) [2025-01-10 01:53:19,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (131 of 140 remaining) [2025-01-10 01:53:19,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (130 of 140 remaining) [2025-01-10 01:53:19,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (129 of 140 remaining) [2025-01-10 01:53:19,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (128 of 140 remaining) [2025-01-10 01:53:19,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (127 of 140 remaining) [2025-01-10 01:53:19,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (126 of 140 remaining) [2025-01-10 01:53:19,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (125 of 140 remaining) [2025-01-10 01:53:19,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (124 of 140 remaining) [2025-01-10 01:53:19,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (123 of 140 remaining) [2025-01-10 01:53:19,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (122 of 140 remaining) [2025-01-10 01:53:19,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (121 of 140 remaining) [2025-01-10 01:53:19,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (120 of 140 remaining) [2025-01-10 01:53:19,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (119 of 140 remaining) [2025-01-10 01:53:19,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (118 of 140 remaining) [2025-01-10 01:53:19,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (117 of 140 remaining) [2025-01-10 01:53:19,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (116 of 140 remaining) [2025-01-10 01:53:19,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (115 of 140 remaining) [2025-01-10 01:53:19,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (114 of 140 remaining) [2025-01-10 01:53:19,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (113 of 140 remaining) [2025-01-10 01:53:19,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (112 of 140 remaining) [2025-01-10 01:53:19,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (111 of 140 remaining) [2025-01-10 01:53:19,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (110 of 140 remaining) [2025-01-10 01:53:19,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (109 of 140 remaining) [2025-01-10 01:53:19,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (108 of 140 remaining) [2025-01-10 01:53:19,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (107 of 140 remaining) [2025-01-10 01:53:19,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (106 of 140 remaining) [2025-01-10 01:53:19,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (105 of 140 remaining) [2025-01-10 01:53:19,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (104 of 140 remaining) [2025-01-10 01:53:19,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 140 remaining) [2025-01-10 01:53:19,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 140 remaining) [2025-01-10 01:53:19,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 140 remaining) [2025-01-10 01:53:19,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 140 remaining) [2025-01-10 01:53:19,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 140 remaining) [2025-01-10 01:53:19,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 140 remaining) [2025-01-10 01:53:19,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 140 remaining) [2025-01-10 01:53:19,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 140 remaining) [2025-01-10 01:53:19,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 140 remaining) [2025-01-10 01:53:19,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 140 remaining) [2025-01-10 01:53:19,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 140 remaining) [2025-01-10 01:53:19,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 140 remaining) [2025-01-10 01:53:19,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 140 remaining) [2025-01-10 01:53:19,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 140 remaining) [2025-01-10 01:53:19,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 140 remaining) [2025-01-10 01:53:19,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 140 remaining) [2025-01-10 01:53:19,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 140 remaining) [2025-01-10 01:53:19,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 140 remaining) [2025-01-10 01:53:19,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 140 remaining) [2025-01-10 01:53:19,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 140 remaining) [2025-01-10 01:53:19,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 140 remaining) [2025-01-10 01:53:19,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 140 remaining) [2025-01-10 01:53:19,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 140 remaining) [2025-01-10 01:53:19,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 140 remaining) [2025-01-10 01:53:19,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 140 remaining) [2025-01-10 01:53:19,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 140 remaining) [2025-01-10 01:53:19,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 140 remaining) [2025-01-10 01:53:19,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 140 remaining) [2025-01-10 01:53:19,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 140 remaining) [2025-01-10 01:53:19,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 140 remaining) [2025-01-10 01:53:19,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 140 remaining) [2025-01-10 01:53:19,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 140 remaining) [2025-01-10 01:53:19,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 140 remaining) [2025-01-10 01:53:19,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 140 remaining) [2025-01-10 01:53:19,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 140 remaining) [2025-01-10 01:53:19,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 140 remaining) [2025-01-10 01:53:19,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 140 remaining) [2025-01-10 01:53:19,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 140 remaining) [2025-01-10 01:53:19,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 140 remaining) [2025-01-10 01:53:19,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 140 remaining) [2025-01-10 01:53:19,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 140 remaining) [2025-01-10 01:53:19,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 140 remaining) [2025-01-10 01:53:19,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 140 remaining) [2025-01-10 01:53:19,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 140 remaining) [2025-01-10 01:53:19,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr99ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr102ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr103ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr104ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr105ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr107ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr108ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr109ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr112ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr113ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 140 remaining) [2025-01-10 01:53:19,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 140 remaining) [2025-01-10 01:53:19,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 140 remaining) [2025-01-10 01:53:19,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 140 remaining) [2025-01-10 01:53:19,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr120ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 140 remaining) [2025-01-10 01:53:19,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr121ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 140 remaining) [2025-01-10 01:53:19,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr122ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 140 remaining) [2025-01-10 01:53:19,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr123ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 140 remaining) [2025-01-10 01:53:19,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr124ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 140 remaining) [2025-01-10 01:53:19,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr125ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 140 remaining) [2025-01-10 01:53:19,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr126ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 140 remaining) [2025-01-10 01:53:19,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr127ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 140 remaining) [2025-01-10 01:53:19,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr128ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 140 remaining) [2025-01-10 01:53:19,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr129ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 140 remaining) [2025-01-10 01:53:19,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 140 remaining) [2025-01-10 01:53:19,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr131ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 140 remaining) [2025-01-10 01:53:19,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr132ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 140 remaining) [2025-01-10 01:53:19,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr133ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 140 remaining) [2025-01-10 01:53:19,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr134ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 140 remaining) [2025-01-10 01:53:19,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr135ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 140 remaining) [2025-01-10 01:53:19,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr136ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 140 remaining) [2025-01-10 01:53:19,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 140 remaining) [2025-01-10 01:53:19,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr138ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 140 remaining) [2025-01-10 01:53:19,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 140 remaining) [2025-01-10 01:53:20,005 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 01:53:20,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:53:20,194 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:53:20,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 01:53:20,652 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:53:20,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:53:20 BoogieIcfgContainer [2025-01-10 01:53:20,667 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:53:20,668 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:53:20,668 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:53:20,668 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:53:20,668 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:52:57" (3/4) ... [2025-01-10 01:53:20,670 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:53:20,677 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-01-10 01:53:20,684 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-10 01:53:20,686 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 01:53:20,686 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 01:53:20,686 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 01:53:20,777 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:53:20,778 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:53:20,778 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:53:20,778 INFO L158 Benchmark]: Toolchain (without parser) took 24351.82ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 122.3MB in the beginning and 185.9MB in the end (delta: -63.6MB). Peak memory consumption was 144.9MB. Max. memory is 16.1GB. [2025-01-10 01:53:20,778 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:53:20,778 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.98ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 110.1MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:53:20,778 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.58ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 108.1MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:53:20,779 INFO L158 Benchmark]: Boogie Preprocessor took 48.79ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 106.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:53:20,779 INFO L158 Benchmark]: RCFGBuilder took 686.18ms. Allocated memory is still 167.8MB. Free memory was 106.4MB in the beginning and 68.3MB in the end (delta: 38.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-10 01:53:20,779 INFO L158 Benchmark]: TraceAbstraction took 23279.30ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 67.5MB in the beginning and 194.2MB in the end (delta: -126.7MB). Peak memory consumption was 86.2MB. Max. memory is 16.1GB. [2025-01-10 01:53:20,779 INFO L158 Benchmark]: Witness Printer took 110.04ms. Allocated memory is still 377.5MB. Free memory was 194.2MB in the beginning and 185.9MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:53:20,780 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.28ms. Allocated memory is still 201.3MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.98ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 110.1MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.58ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 108.1MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.79ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 106.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 686.18ms. Allocated memory is still 167.8MB. Free memory was 106.4MB in the beginning and 68.3MB in the end (delta: 38.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 23279.30ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 67.5MB in the beginning and 194.2MB in the end (delta: -126.7MB). Peak memory consumption was 86.2MB. Max. memory is 16.1GB. * Witness Printer took 110.04ms. Allocated memory is still 377.5MB. Free memory was 194.2MB in the beginning and 185.9MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 306 locations, 140 error locations. Started 1 CEGAR loops. OverallTime: 22.8s, OverallIterations: 31, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5806 SdHoareTripleChecker+Valid, 7.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5656 mSDsluCounter, 12987 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6805 mSDsCounter, 341 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9221 IncrementalHoareTripleChecker+Invalid, 9562 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 341 mSolverCounterUnsat, 6182 mSDtfsCounter, 9221 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2634 GetRequests, 2493 SyntacticMatches, 3 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=652occurred in iteration=19, InterpolantAutomatonStates: 148, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 31 MinimizatonAttempts, 682 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 4383 NumberOfCodeBlocks, 4383 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 3693 ConstructedInterpolants, 14 QuantifiedInterpolants, 24208 SizeOfPredicates, 16 NumberOfNonLiveVariables, 2935 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 41 InterpolantComputations, 19 PerfectInterpolantSequences, 2288/2374 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 140 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((((7 == y) && (z == 12)) && (x == 1)) && (n == 1)) && (0 <= a)) && (counter == 1)) && (a <= 32767)) || ((((((y == 1) && (counter == 0)) && ((((a + 1) <= 0) && (0 <= (a + 32768))) || ((0 <= a) && (a <= 32767)))) && (n == 0)) && (x == 0)) && (6 == z))) RESULT: Ultimate proved your program to be correct! [2025-01-10 01:53:20,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE