./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps2-ll_valuebound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps2-ll_valuebound10.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 464ff86972962e190fa8e3bdd89b592f22b90512739ab3fd4df7709eb39adee3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 09:49:39,704 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 09:49:39,753 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 09:49:39,756 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 09:49:39,756 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 09:49:39,769 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 09:49:39,770 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 09:49:39,770 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 09:49:39,770 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 09:49:39,770 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 09:49:39,770 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 09:49:39,770 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 09:49:39,770 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 09:49:39,771 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 09:49:39,771 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 09:49:39,771 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 09:49:39,771 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 09:49:39,771 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 09:49:39,771 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 09:49:39,771 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 09:49:39,771 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 09:49:39,771 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 09:49:39,771 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 09:49:39,771 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 09:49:39,772 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 09:49:39,772 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 09:49:39,772 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 09:49:39,772 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 09:49:39,772 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 09:49:39,772 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 09:49:39,772 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 09:49:39,772 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 09:49:39,772 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 09:49:39,772 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 09:49:39,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:49:39,773 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 09:49:39,773 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 09:49:39,773 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 09:49:39,773 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 09:49:39,773 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 09:49:39,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 09:49:39,773 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 09:49:39,773 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 09:49:39,773 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 09:49:39,773 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 09:49:39,773 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 -> 464ff86972962e190fa8e3bdd89b592f22b90512739ab3fd4df7709eb39adee3 [2025-02-08 09:49:39,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 09:49:39,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 09:49:40,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 09:49:40,002 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 09:49:40,002 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 09:49:40,005 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps2-ll_valuebound10.c [2025-02-08 09:49:41,131 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e1a09aa8/5a4eb88515394fcba5eed5db840b4f9a/FLAG2f52623b0 [2025-02-08 09:49:41,338 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 09:49:41,339 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps2-ll_valuebound10.c [2025-02-08 09:49:41,343 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e1a09aa8/5a4eb88515394fcba5eed5db840b4f9a/FLAG2f52623b0 [2025-02-08 09:49:41,373 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e1a09aa8/5a4eb88515394fcba5eed5db840b4f9a [2025-02-08 09:49:41,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 09:49:41,381 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 09:49:41,382 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 09:49:41,382 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 09:49:41,393 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 09:49:41,395 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:49:41" (1/1) ... [2025-02-08 09:49:41,396 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4db9aec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:49:41, skipping insertion in model container [2025-02-08 09:49:41,396 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:49:41" (1/1) ... [2025-02-08 09:49:41,408 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 09:49:41,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:49:41,515 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 09:49:41,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:49:41,537 INFO L204 MainTranslator]: Completed translation [2025-02-08 09:49:41,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:49:41 WrapperNode [2025-02-08 09:49:41,537 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 09:49:41,538 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 09:49:41,539 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 09:49:41,539 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 09:49:41,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:49:41" (1/1) ... [2025-02-08 09:49:41,548 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:49:41" (1/1) ... [2025-02-08 09:49:41,559 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2025-02-08 09:49:41,560 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 09:49:41,560 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 09:49:41,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 09:49:41,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 09:49:41,566 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:49:41" (1/1) ... [2025-02-08 09:49:41,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:49:41" (1/1) ... [2025-02-08 09:49:41,571 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:49:41" (1/1) ... [2025-02-08 09:49:41,579 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-02-08 09:49:41,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:49:41" (1/1) ... [2025-02-08 09:49:41,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:49:41" (1/1) ... [2025-02-08 09:49:41,582 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:49:41" (1/1) ... [2025-02-08 09:49:41,583 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:49:41" (1/1) ... [2025-02-08 09:49:41,583 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:49:41" (1/1) ... [2025-02-08 09:49:41,586 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:49:41" (1/1) ... [2025-02-08 09:49:41,587 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 09:49:41,587 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 09:49:41,587 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 09:49:41,587 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 09:49:41,588 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:49:41" (1/1) ... [2025-02-08 09:49:41,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:49:41,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:49:41,617 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-02-08 09:49:41,621 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-02-08 09:49:41,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 09:49:41,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 09:49:41,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 09:49:41,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 09:49:41,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 09:49:41,635 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 09:49:41,670 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 09:49:41,672 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 09:49:41,843 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-02-08 09:49:41,843 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 09:49:41,850 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 09:49:41,850 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 09:49:41,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:49:41 BoogieIcfgContainer [2025-02-08 09:49:41,850 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 09:49:41,852 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 09:49:41,852 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 09:49:41,855 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 09:49:41,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 09:49:41" (1/3) ... [2025-02-08 09:49:41,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c4d2e35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:49:41, skipping insertion in model container [2025-02-08 09:49:41,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:49:41" (2/3) ... [2025-02-08 09:49:41,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c4d2e35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:49:41, skipping insertion in model container [2025-02-08 09:49:41,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:49:41" (3/3) ... [2025-02-08 09:49:41,857 INFO L128 eAbstractionObserver]: Analyzing ICFG ps2-ll_valuebound10.c [2025-02-08 09:49:41,866 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 09:49:41,867 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ps2-ll_valuebound10.c that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 22 error locations. [2025-02-08 09:49:41,898 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 09:49:41,907 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;@482a3974, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 09:49:41,908 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-02-08 09:49:41,911 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 32 states have (on average 1.8125) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:49:41,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 09:49:41,915 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:49:41,915 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 09:49:41,915 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 09:49:41,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:49:41,920 INFO L85 PathProgramCache]: Analyzing trace with hash 80098995, now seen corresponding path program 1 times [2025-02-08 09:49:41,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:49:41,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929892242] [2025-02-08 09:49:41,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:49:41,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:49:41,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 09:49:41,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 09:49:41,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:49:41,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:49:41,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:49:41,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:49:41,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929892242] [2025-02-08 09:49:41,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929892242] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:49:41,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:49:41,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:49:42,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119510504] [2025-02-08 09:49:42,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:49:42,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 09:49:42,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:49:42,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 09:49:42,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 09:49:42,018 INFO L87 Difference]: Start difference. First operand has 58 states, 32 states have (on average 1.8125) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:49:42,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:49:42,035 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2025-02-08 09:49:42,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 09:49:42,036 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 09:49:42,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:49:42,040 INFO L225 Difference]: With dead ends: 112 [2025-02-08 09:49:42,040 INFO L226 Difference]: Without dead ends: 52 [2025-02-08 09:49:42,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 09:49:42,044 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:49:42,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:49:42,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-08 09:49:42,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-02-08 09:49:42,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 49 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 09:49:42,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2025-02-08 09:49:42,070 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 5 [2025-02-08 09:49:42,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:49:42,070 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2025-02-08 09:49:42,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:49:42,070 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2025-02-08 09:49:42,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 09:49:42,070 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:49:42,070 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 09:49:42,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 09:49:42,071 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 09:49:42,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:49:42,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1810974915, now seen corresponding path program 1 times [2025-02-08 09:49:42,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:49:42,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737757979] [2025-02-08 09:49:42,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:49:42,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:49:42,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 09:49:42,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 09:49:42,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:49:42,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 09:49:42,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1853518776] [2025-02-08 09:49:42,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:49:42,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:49:42,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:49:42,094 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-02-08 09:49:42,095 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-02-08 09:49:42,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 09:49:42,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 09:49:42,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:49:42,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:49:42,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 09:49:42,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:49:42,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:49:42,156 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:49:42,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:49:42,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737757979] [2025-02-08 09:49:42,157 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 09:49:42,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853518776] [2025-02-08 09:49:42,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853518776] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:49:42,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:49:42,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:49:42,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578033855] [2025-02-08 09:49:42,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:49:42,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:49:42,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:49:42,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:49:42,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:49:42,158 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:49:42,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:49:42,237 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2025-02-08 09:49:42,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:49:42,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 09:49:42,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:49:42,238 INFO L225 Difference]: With dead ends: 85 [2025-02-08 09:49:42,238 INFO L226 Difference]: Without dead ends: 81 [2025-02-08 09:49:42,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:49:42,239 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 25 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:49:42,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 52 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:49:42,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-08 09:49:42,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2025-02-08 09:49:42,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 65 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:49:42,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2025-02-08 09:49:42,251 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 6 [2025-02-08 09:49:42,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:49:42,251 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2025-02-08 09:49:42,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:49:42,252 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2025-02-08 09:49:42,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 09:49:42,252 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:49:42,252 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:49:42,261 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-02-08 09:49:42,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:49:42,453 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 09:49:42,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:49:42,453 INFO L85 PathProgramCache]: Analyzing trace with hash -305647504, now seen corresponding path program 1 times [2025-02-08 09:49:42,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:49:42,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968209508] [2025-02-08 09:49:42,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:49:42,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:49:42,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 09:49:42,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 09:49:42,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:49:42,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:49:42,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:49:42,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:49:42,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968209508] [2025-02-08 09:49:42,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968209508] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:49:42,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:49:42,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:49:42,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970335434] [2025-02-08 09:49:42,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:49:42,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:49:42,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:49:42,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:49:42,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:49:42,520 INFO L87 Difference]: Start difference. First operand 69 states and 79 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-02-08 09:49:42,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:49:42,603 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2025-02-08 09:49:42,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:49:42,604 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-02-08 09:49:42,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:49:42,604 INFO L225 Difference]: With dead ends: 87 [2025-02-08 09:49:42,604 INFO L226 Difference]: Without dead ends: 79 [2025-02-08 09:49:42,604 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-02-08 09:49:42,605 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 22 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:49:42,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 56 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:49:42,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-08 09:49:42,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2025-02-08 09:49:42,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 70 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:49:42,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2025-02-08 09:49:42,612 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 7 [2025-02-08 09:49:42,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:49:42,612 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2025-02-08 09:49:42,612 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-02-08 09:49:42,612 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2025-02-08 09:49:42,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 09:49:42,612 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:49:42,612 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:49:42,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 09:49:42,613 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 09:49:42,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:49:42,613 INFO L85 PathProgramCache]: Analyzing trace with hash -214113287, now seen corresponding path program 1 times [2025-02-08 09:49:42,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:49:42,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134589251] [2025-02-08 09:49:42,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:49:42,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:49:42,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 09:49:42,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 09:49:42,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:49:42,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:49:42,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:49:42,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:49:42,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134589251] [2025-02-08 09:49:42,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134589251] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:49:42,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:49:42,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:49:42,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212274275] [2025-02-08 09:49:42,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:49:42,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:49:42,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:49:42,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:49:42,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:49:42,694 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:49:42,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:49:42,788 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2025-02-08 09:49:42,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:49:42,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-08 09:49:42,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:49:42,789 INFO L225 Difference]: With dead ends: 83 [2025-02-08 09:49:42,789 INFO L226 Difference]: Without dead ends: 71 [2025-02-08 09:49:42,789 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-02-08 09:49:42,790 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 21 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:49:42,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 67 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:49:42,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-08 09:49:42,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2025-02-08 09:49:42,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.5) internal successors, (66), 63 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:49:42,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2025-02-08 09:49:42,813 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 10 [2025-02-08 09:49:42,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:49:42,813 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2025-02-08 09:49:42,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:49:42,814 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2025-02-08 09:49:42,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 09:49:42,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:49:42,814 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:49:42,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 09:49:42,814 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 09:49:42,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:49:42,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1777044311, now seen corresponding path program 1 times [2025-02-08 09:49:42,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:49:42,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575264616] [2025-02-08 09:49:42,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:49:42,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:49:42,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 09:49:42,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 09:49:42,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:49:42,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:49:42,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:49:42,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:49:42,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575264616] [2025-02-08 09:49:42,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575264616] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:49:42,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:49:42,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:49:42,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752068546] [2025-02-08 09:49:42,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:49:42,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:49:42,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:49:42,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:49:42,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:49:42,872 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 09:49:42,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:49:42,885 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2025-02-08 09:49:42,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:49:42,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-02-08 09:49:42,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:49:42,886 INFO L225 Difference]: With dead ends: 69 [2025-02-08 09:49:42,886 INFO L226 Difference]: Without dead ends: 67 [2025-02-08 09:49:42,886 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-02-08 09:49:42,887 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:49:42,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 93 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:49:42,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-08 09:49:42,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-02-08 09:49:42,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 63 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:49:42,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2025-02-08 09:49:42,891 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 19 [2025-02-08 09:49:42,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:49:42,891 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2025-02-08 09:49:42,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 09:49:42,891 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2025-02-08 09:49:42,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 09:49:42,892 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:49:42,892 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:49:42,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 09:49:42,892 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 09:49:42,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:49:42,893 INFO L85 PathProgramCache]: Analyzing trace with hash -670691547, now seen corresponding path program 1 times [2025-02-08 09:49:42,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:49:42,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309036332] [2025-02-08 09:49:42,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:49:42,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:49:42,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 09:49:42,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 09:49:42,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:49:42,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:49:42,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:49:42,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:49:42,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309036332] [2025-02-08 09:49:42,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309036332] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:49:42,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:49:42,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:49:42,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292873668] [2025-02-08 09:49:42,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:49:42,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:49:42,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:49:42,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:49:42,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:49:42,981 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 09:49:43,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:49:43,057 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2025-02-08 09:49:43,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:49:43,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-02-08 09:49:43,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:49:43,058 INFO L225 Difference]: With dead ends: 70 [2025-02-08 09:49:43,058 INFO L226 Difference]: Without dead ends: 69 [2025-02-08 09:49:43,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:49:43,059 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:49:43,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 64 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:49:43,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-08 09:49:43,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2025-02-08 09:49:43,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 64 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:49:43,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2025-02-08 09:49:43,067 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 23 [2025-02-08 09:49:43,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:49:43,069 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2025-02-08 09:49:43,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 09:49:43,069 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2025-02-08 09:49:43,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 09:49:43,069 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:49:43,069 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:49:43,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 09:49:43,070 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 09:49:43,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:49:43,070 INFO L85 PathProgramCache]: Analyzing trace with hash 683398511, now seen corresponding path program 1 times [2025-02-08 09:49:43,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:49:43,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819364186] [2025-02-08 09:49:43,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:49:43,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:49:43,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 09:49:43,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 09:49:43,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:49:43,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:49:43,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:49:43,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:49:43,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819364186] [2025-02-08 09:49:43,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819364186] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:49:43,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:49:43,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:49:43,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691569973] [2025-02-08 09:49:43,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:49:43,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:49:43,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:49:43,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:49:43,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:49:43,155 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 09:49:43,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:49:43,229 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2025-02-08 09:49:43,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:49:43,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-02-08 09:49:43,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:49:43,230 INFO L225 Difference]: With dead ends: 70 [2025-02-08 09:49:43,230 INFO L226 Difference]: Without dead ends: 69 [2025-02-08 09:49:43,231 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-02-08 09:49:43,231 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:49:43,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:49:43,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-08 09:49:43,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-02-08 09:49:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.434782608695652) internal successors, (66), 65 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:49:43,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2025-02-08 09:49:43,236 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 24 [2025-02-08 09:49:43,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:49:43,236 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2025-02-08 09:49:43,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 09:49:43,237 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2025-02-08 09:49:43,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 09:49:43,237 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:49:43,237 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:49:43,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 09:49:43,237 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 09:49:43,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:49:43,238 INFO L85 PathProgramCache]: Analyzing trace with hash 980076962, now seen corresponding path program 1 times [2025-02-08 09:49:43,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:49:43,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796325861] [2025-02-08 09:49:43,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:49:43,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:49:43,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 09:49:43,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 09:49:43,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:49:43,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 09:49:43,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1474181494] [2025-02-08 09:49:43,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:49:43,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:49:43,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:49:43,252 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-02-08 09:49:43,254 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-02-08 09:49:43,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 09:49:43,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 09:49:43,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:49:43,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:49:43,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 09:49:43,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:49:43,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:49:43,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:49:43,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:49:43,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:49:43,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796325861] [2025-02-08 09:49:43,410 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 09:49:43,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474181494] [2025-02-08 09:49:43,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474181494] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:49:43,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 09:49:43,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-02-08 09:49:43,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813256872] [2025-02-08 09:49:43,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 09:49:43,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 09:49:43,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:49:43,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 09:49:43,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 09:49:43,414 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:49:43,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:49:43,542 INFO L93 Difference]: Finished difference Result 135 states and 166 transitions. [2025-02-08 09:49:43,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 09:49:43,542 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-02-08 09:49:43,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:49:43,543 INFO L225 Difference]: With dead ends: 135 [2025-02-08 09:49:43,543 INFO L226 Difference]: Without dead ends: 131 [2025-02-08 09:49:43,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-02-08 09:49:43,543 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 91 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:49:43,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 96 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:49:43,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-08 09:49:43,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 103. [2025-02-08 09:49:43,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 81 states have (on average 1.4814814814814814) internal successors, (120), 97 states have internal predecessors, (120), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 09:49:43,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 128 transitions. [2025-02-08 09:49:43,550 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 128 transitions. Word has length 27 [2025-02-08 09:49:43,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:49:43,550 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 128 transitions. [2025-02-08 09:49:43,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:49:43,551 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 128 transitions. [2025-02-08 09:49:43,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 09:49:43,551 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:49:43,551 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:49:43,560 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-02-08 09:49:43,754 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-02-08 09:49:43,754 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 09:49:43,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:49:43,754 INFO L85 PathProgramCache]: Analyzing trace with hash 317614763, now seen corresponding path program 1 times [2025-02-08 09:49:43,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:49:43,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990624900] [2025-02-08 09:49:43,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:49:43,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:49:43,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 09:49:43,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 09:49:43,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:49:43,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:49:43,855 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:49:43,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:49:43,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990624900] [2025-02-08 09:49:43,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990624900] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:49:43,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585056896] [2025-02-08 09:49:43,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:49:43,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:49:43,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:49:43,858 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-02-08 09:49:43,859 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-02-08 09:49:43,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 09:49:43,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 09:49:43,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:49:43,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:49:43,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 09:49:43,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:49:43,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:49:43,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:49:44,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:49:44,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585056896] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:49:44,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:49:44,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-08 09:49:44,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938547285] [2025-02-08 09:49:44,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:49:44,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 09:49:44,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:49:44,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 09:49:44,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-02-08 09:49:44,039 INFO L87 Difference]: Start difference. First operand 103 states and 128 transitions. Second operand has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 10 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 09:49:44,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:49:44,166 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2025-02-08 09:49:44,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 09:49:44,166 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 10 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2025-02-08 09:49:44,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:49:44,167 INFO L225 Difference]: With dead ends: 103 [2025-02-08 09:49:44,167 INFO L226 Difference]: Without dead ends: 100 [2025-02-08 09:49:44,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-02-08 09:49:44,167 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 46 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:49:44,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 83 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:49:44,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-08 09:49:44,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-02-08 09:49:44,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 81 states have (on average 1.3950617283950617) internal successors, (113), 94 states have internal predecessors, (113), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 09:49:44,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 121 transitions. [2025-02-08 09:49:44,176 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 121 transitions. Word has length 28 [2025-02-08 09:49:44,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:49:44,176 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 121 transitions. [2025-02-08 09:49:44,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 10 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 09:49:44,177 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 121 transitions. [2025-02-08 09:49:44,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 09:49:44,177 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:49:44,177 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 09:49:44,183 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-02-08 09:49:44,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:49:44,378 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 09:49:44,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:49:44,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1256123072, now seen corresponding path program 1 times [2025-02-08 09:49:44,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:49:44,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176782419] [2025-02-08 09:49:44,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:49:44,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:49:44,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 09:49:44,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 09:49:44,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:49:44,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:49:44,440 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:49:44,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:49:44,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176782419] [2025-02-08 09:49:44,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176782419] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:49:44,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745754146] [2025-02-08 09:49:44,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:49:44,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:49:44,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:49:44,443 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-02-08 09:49:44,445 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-02-08 09:49:44,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 09:49:44,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 09:49:44,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:49:44,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:49:44,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 09:49:44,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:49:44,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:49:44,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:49:44,602 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:49:44,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745754146] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:49:44,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:49:44,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-08 09:49:44,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942190079] [2025-02-08 09:49:44,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:49:44,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 09:49:44,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:49:44,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 09:49:44,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2025-02-08 09:49:44,605 INFO L87 Difference]: Start difference. First operand 100 states and 121 transitions. Second operand has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 10 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 09:49:44,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:49:44,728 INFO L93 Difference]: Finished difference Result 112 states and 133 transitions. [2025-02-08 09:49:44,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 09:49:44,729 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 10 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2025-02-08 09:49:44,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:49:44,729 INFO L225 Difference]: With dead ends: 112 [2025-02-08 09:49:44,729 INFO L226 Difference]: Without dead ends: 105 [2025-02-08 09:49:44,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=72, Unknown=0, NotChecked=0, Total=132 [2025-02-08 09:49:44,730 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 52 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:49:44,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 88 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:49:44,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-08 09:49:44,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 95. [2025-02-08 09:49:44,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 81 states have (on average 1.2469135802469136) internal successors, (101), 89 states have internal predecessors, (101), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 09:49:44,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2025-02-08 09:49:44,742 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 29 [2025-02-08 09:49:44,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:49:44,742 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2025-02-08 09:49:44,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 10 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 09:49:44,742 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2025-02-08 09:49:44,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-08 09:49:44,746 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:49:44,746 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:49:44,753 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-02-08 09:49:44,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-08 09:49:44,947 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 09:49:44,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:49:44,948 INFO L85 PathProgramCache]: Analyzing trace with hash 248462302, now seen corresponding path program 1 times [2025-02-08 09:49:44,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:49:44,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140302463] [2025-02-08 09:49:44,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:49:44,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:49:44,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 09:49:44,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 09:49:44,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:49:44,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:49:45,016 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:49:45,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:49:45,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140302463] [2025-02-08 09:49:45,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140302463] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:49:45,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460728276] [2025-02-08 09:49:45,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:49:45,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:49:45,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:49:45,019 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:49:45,020 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-02-08 09:49:45,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 09:49:45,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 09:49:45,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:49:45,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:49:45,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 09:49:45,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:49:45,141 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:49:45,141 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:49:45,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460728276] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:49:45,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:49:45,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-02-08 09:49:45,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031014470] [2025-02-08 09:49:45,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:49:45,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 09:49:45,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:49:45,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 09:49:45,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 09:49:45,142 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 09:49:45,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:49:45,195 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2025-02-08 09:49:45,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 09:49:45,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2025-02-08 09:49:45,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:49:45,196 INFO L225 Difference]: With dead ends: 95 [2025-02-08 09:49:45,196 INFO L226 Difference]: Without dead ends: 83 [2025-02-08 09:49:45,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 09:49:45,196 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 34 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:49:45,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 48 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:49:45,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-08 09:49:45,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-02-08 09:49:45,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 77 states have internal predecessors, (83), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 09:49:45,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2025-02-08 09:49:45,200 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 31 [2025-02-08 09:49:45,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:49:45,201 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2025-02-08 09:49:45,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 09:49:45,201 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2025-02-08 09:49:45,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 09:49:45,201 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:49:45,201 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:49:45,207 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-02-08 09:49:45,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-08 09:49:45,402 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 09:49:45,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:49:45,402 INFO L85 PathProgramCache]: Analyzing trace with hash -639226268, now seen corresponding path program 1 times [2025-02-08 09:49:45,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:49:45,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171561676] [2025-02-08 09:49:45,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:49:45,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:49:45,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 09:49:45,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 09:49:45,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:49:45,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:49:45,441 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 09:49:45,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:49:45,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171561676] [2025-02-08 09:49:45,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171561676] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:49:45,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174430960] [2025-02-08 09:49:45,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:49:45,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:49:45,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:49:45,444 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-02-08 09:49:45,445 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-02-08 09:49:45,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 09:49:45,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 09:49:45,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:49:45,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:49:45,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 09:49:45,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:49:45,512 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 09:49:45,512 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:49:45,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174430960] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:49:45,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:49:45,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-08 09:49:45,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559689891] [2025-02-08 09:49:45,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:49:45,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:49:45,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:49:45,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:49:45,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 09:49:45,513 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:49:45,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:49:45,532 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2025-02-08 09:49:45,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:49:45,533 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2025-02-08 09:49:45,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:49:45,534 INFO L225 Difference]: With dead ends: 83 [2025-02-08 09:49:45,534 INFO L226 Difference]: Without dead ends: 82 [2025-02-08 09:49:45,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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-02-08 09:49:45,534 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:49:45,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 50 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:49:45,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-08 09:49:45,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-02-08 09:49:45,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 73 states have (on average 1.095890410958904) internal successors, (80), 76 states have internal predecessors, (80), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 09:49:45,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2025-02-08 09:49:45,542 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 40 [2025-02-08 09:49:45,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:49:45,542 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2025-02-08 09:49:45,542 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:49:45,542 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2025-02-08 09:49:45,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 09:49:45,542 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:49:45,542 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:49:45,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 09:49:45,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-08 09:49:45,743 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 09:49:45,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:49:45,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1658822168, now seen corresponding path program 1 times [2025-02-08 09:49:45,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:49:45,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772095473] [2025-02-08 09:49:45,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:49:45,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:49:45,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 09:49:45,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 09:49:45,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:49:45,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:49:45,783 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 09:49:45,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:49:45,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772095473] [2025-02-08 09:49:45,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772095473] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:49:45,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794686118] [2025-02-08 09:49:45,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:49:45,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:49:45,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:49:45,785 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-02-08 09:49:45,786 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-02-08 09:49:45,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 09:49:45,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 09:49:45,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:49:45,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:49:45,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 09:49:45,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:49:45,865 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 09:49:45,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:49:45,909 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 09:49:45,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794686118] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:49:45,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:49:45,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 09:49:45,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927020686] [2025-02-08 09:49:45,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:49:45,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 09:49:45,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:49:45,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 09:49:45,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 09:49:45,911 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 09:49:45,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:49:45,936 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2025-02-08 09:49:45,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 09:49:45,936 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 41 [2025-02-08 09:49:45,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:49:45,937 INFO L225 Difference]: With dead ends: 95 [2025-02-08 09:49:45,937 INFO L226 Difference]: Without dead ends: 94 [2025-02-08 09:49:45,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 78 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-02-08 09:49:45,938 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:49:45,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 102 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:49:45,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-08 09:49:45,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2025-02-08 09:49:45,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 82 states have (on average 1.0731707317073171) internal successors, (88), 85 states have internal predecessors, (88), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 09:49:45,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2025-02-08 09:49:45,942 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 41 [2025-02-08 09:49:45,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:49:45,942 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2025-02-08 09:49:45,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 09:49:45,942 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2025-02-08 09:49:45,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-08 09:49:45,943 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:49:45,943 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2025-02-08 09:49:45,948 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-02-08 09:49:46,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:49:46,147 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 09:49:46,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:49:46,147 INFO L85 PathProgramCache]: Analyzing trace with hash 856927887, now seen corresponding path program 1 times [2025-02-08 09:49:46,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:49:46,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326797133] [2025-02-08 09:49:46,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:49:46,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:49:46,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 09:49:46,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 09:49:46,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:49:46,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:49:46,250 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 09:49:46,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:49:46,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326797133] [2025-02-08 09:49:46,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326797133] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:49:46,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110830403] [2025-02-08 09:49:46,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:49:46,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:49:46,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:49:46,252 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-02-08 09:49:46,254 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-02-08 09:49:46,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 09:49:46,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 09:49:46,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:49:46,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:49:46,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 09:49:46,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:49:46,456 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 09:49:46,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:49:46,585 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 09:49:46,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110830403] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:49:46,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:49:46,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-02-08 09:49:46,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759727981] [2025-02-08 09:49:46,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:49:46,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 09:49:46,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:49:46,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 09:49:46,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2025-02-08 09:49:46,589 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 20 states, 19 states have (on average 8.0) internal successors, (152), 20 states have internal predecessors, (152), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 09:49:46,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:49:46,780 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2025-02-08 09:49:46,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 09:49:46,781 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 8.0) internal successors, (152), 20 states have internal predecessors, (152), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 66 [2025-02-08 09:49:46,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:49:46,782 INFO L225 Difference]: With dead ends: 133 [2025-02-08 09:49:46,782 INFO L226 Difference]: Without dead ends: 132 [2025-02-08 09:49:46,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=248, Invalid=402, Unknown=0, NotChecked=0, Total=650 [2025-02-08 09:49:46,783 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:49:46,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 88 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:49:46,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-02-08 09:49:46,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2025-02-08 09:49:46,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 118 states have (on average 1.0932203389830508) internal successors, (129), 121 states have internal predecessors, (129), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 09:49:46,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2025-02-08 09:49:46,788 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 66 [2025-02-08 09:49:46,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:49:46,788 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2025-02-08 09:49:46,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 8.0) internal successors, (152), 20 states have internal predecessors, (152), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 09:49:46,789 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2025-02-08 09:49:46,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-08 09:49:46,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:49:46,789 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2025-02-08 09:49:46,795 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-02-08 09:49:46,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:49:46,994 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 09:49:46,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:49:46,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1591622240, now seen corresponding path program 2 times [2025-02-08 09:49:46,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:49:46,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245659707] [2025-02-08 09:49:46,995 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:49:46,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:49:47,000 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-02-08 09:49:47,005 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 09:49:47,006 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 09:49:47,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:49:47,103 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 09:49:47,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:49:47,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245659707] [2025-02-08 09:49:47,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245659707] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:49:47,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673104766] [2025-02-08 09:49:47,104 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:49:47,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:49:47,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:49:47,106 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-02-08 09:49:47,118 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-02-08 09:49:47,136 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-02-08 09:49:47,148 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 09:49:47,148 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 09:49:47,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:49:47,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 09:49:47,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:49:47,315 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 09:49:47,315 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:49:47,451 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 09:49:47,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673104766] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:49:47,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:49:47,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-02-08 09:49:47,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889921514] [2025-02-08 09:49:47,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:49:47,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-08 09:49:47,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:49:47,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-08 09:49:47,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=297, Unknown=0, NotChecked=0, Total=462 [2025-02-08 09:49:47,453 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand has 22 states, 21 states have (on average 7.714285714285714) internal successors, (162), 22 states have internal predecessors, (162), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 09:49:47,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:49:47,707 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2025-02-08 09:49:47,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 09:49:47,707 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 7.714285714285714) internal successors, (162), 22 states have internal predecessors, (162), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 71 [2025-02-08 09:49:47,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:49:47,708 INFO L225 Difference]: With dead ends: 139 [2025-02-08 09:49:47,708 INFO L226 Difference]: Without dead ends: 138 [2025-02-08 09:49:47,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=321, Invalid=549, Unknown=0, NotChecked=0, Total=870 [2025-02-08 09:49:47,709 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 58 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:49:47,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 129 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:49:47,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-02-08 09:49:47,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2025-02-08 09:49:47,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 123 states have (on average 1.0731707317073171) internal successors, (132), 126 states have internal predecessors, (132), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 09:49:47,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2025-02-08 09:49:47,724 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 71 [2025-02-08 09:49:47,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:49:47,724 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2025-02-08 09:49:47,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 7.714285714285714) internal successors, (162), 22 states have internal predecessors, (162), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 09:49:47,724 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2025-02-08 09:49:47,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-08 09:49:47,725 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:49:47,725 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2025-02-08 09:49:47,732 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-02-08 09:49:47,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:49:47,931 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 09:49:47,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:49:47,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1944645251, now seen corresponding path program 2 times [2025-02-08 09:49:47,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:49:47,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294624088] [2025-02-08 09:49:47,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:49:47,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:49:47,936 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 90 statements into 2 equivalence classes. [2025-02-08 09:49:47,946 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 90 of 90 statements. [2025-02-08 09:49:47,946 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 09:49:47,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 09:49:47,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1269716099] [2025-02-08 09:49:47,947 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:49:47,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:49:47,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:49:47,949 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-02-08 09:49:47,950 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-02-08 09:49:47,969 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 90 statements into 2 equivalence classes. [2025-02-08 09:49:47,984 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 90 of 90 statements. [2025-02-08 09:49:47,984 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 09:49:47,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:49:47,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 09:49:47,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:49:48,068 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 09:49:48,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:49:48,232 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 09:49:48,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:49:48,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294624088] [2025-02-08 09:49:48,232 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 09:49:48,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269716099] [2025-02-08 09:49:48,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269716099] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:49:48,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 09:49:48,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-02-08 09:49:48,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97231352] [2025-02-08 09:49:48,233 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 09:49:48,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 09:49:48,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:49:48,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 09:49:48,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-02-08 09:49:48,234 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand has 12 states, 11 states have (on average 12.818181818181818) internal successors, (141), 12 states have internal predecessors, (141), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-08 09:49:48,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:49:48,482 INFO L93 Difference]: Finished difference Result 192 states and 209 transitions. [2025-02-08 09:49:48,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 09:49:48,483 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 12.818181818181818) internal successors, (141), 12 states have internal predecessors, (141), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 90 [2025-02-08 09:49:48,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:49:48,484 INFO L225 Difference]: With dead ends: 192 [2025-02-08 09:49:48,484 INFO L226 Difference]: Without dead ends: 191 [2025-02-08 09:49:48,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2025-02-08 09:49:48,484 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 93 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 09:49:48,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 262 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 09:49:48,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-02-08 09:49:48,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 184. [2025-02-08 09:49:48,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 169 states have (on average 1.0828402366863905) internal successors, (183), 172 states have internal predecessors, (183), 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-02-08 09:49:48,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 203 transitions. [2025-02-08 09:49:48,491 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 203 transitions. Word has length 90 [2025-02-08 09:49:48,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:49:48,491 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 203 transitions. [2025-02-08 09:49:48,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 12.818181818181818) internal successors, (141), 12 states have internal predecessors, (141), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-08 09:49:48,492 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 203 transitions. [2025-02-08 09:49:48,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-08 09:49:48,492 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:49:48,492 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2025-02-08 09:49:48,502 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-02-08 09:49:48,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-08 09:49:48,696 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 09:49:48,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:49:48,699 INFO L85 PathProgramCache]: Analyzing trace with hash 280464051, now seen corresponding path program 2 times [2025-02-08 09:49:48,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:49:48,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110155884] [2025-02-08 09:49:48,699 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:49:48,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:49:48,703 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 104 statements into 2 equivalence classes. [2025-02-08 09:49:48,706 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 104 statements. [2025-02-08 09:49:48,706 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 09:49:48,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:49:48,726 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-02-08 09:49:48,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:49:48,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110155884] [2025-02-08 09:49:48,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110155884] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:49:48,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230631516] [2025-02-08 09:49:48,727 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:49:48,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:49:48,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:49:48,729 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-02-08 09:49:48,730 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-02-08 09:49:48,750 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 104 statements into 2 equivalence classes. [2025-02-08 09:49:48,755 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 104 statements. [2025-02-08 09:49:48,755 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 09:49:48,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:49:48,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 09:49:48,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:49:48,831 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-02-08 09:49:48,832 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:49:48,926 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-02-08 09:49:48,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230631516] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:49:48,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:49:48,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-02-08 09:49:48,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61501919] [2025-02-08 09:49:48,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:49:48,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 09:49:48,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:49:48,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 09:49:48,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 09:49:48,928 INFO L87 Difference]: Start difference. First operand 184 states and 203 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:49:48,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:49:48,948 INFO L93 Difference]: Finished difference Result 184 states and 203 transitions. [2025-02-08 09:49:48,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 09:49:48,949 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 104 [2025-02-08 09:49:48,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:49:48,950 INFO L225 Difference]: With dead ends: 184 [2025-02-08 09:49:48,950 INFO L226 Difference]: Without dead ends: 183 [2025-02-08 09:49:48,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-08 09:49:48,950 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 37 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:49:48,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 53 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:49:48,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-02-08 09:49:48,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2025-02-08 09:49:48,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 169 states have (on average 1.047337278106509) internal successors, (177), 171 states have internal predecessors, (177), 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-02-08 09:49:48,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 197 transitions. [2025-02-08 09:49:48,957 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 197 transitions. Word has length 104 [2025-02-08 09:49:48,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:49:48,957 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 197 transitions. [2025-02-08 09:49:48,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:49:48,957 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 197 transitions. [2025-02-08 09:49:48,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-08 09:49:48,958 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:49:48,958 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1] [2025-02-08 09:49:48,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-08 09:49:49,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-08 09:49:49,159 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 09:49:49,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:49:49,159 INFO L85 PathProgramCache]: Analyzing trace with hash 653338831, now seen corresponding path program 2 times [2025-02-08 09:49:49,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:49:49,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934708917] [2025-02-08 09:49:49,159 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:49:49,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:49:49,166 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 150 statements into 2 equivalence classes. [2025-02-08 09:49:49,186 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 150 of 150 statements. [2025-02-08 09:49:49,186 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 09:49:49,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:49:49,495 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 357 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-08 09:49:49,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:49:49,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934708917] [2025-02-08 09:49:49,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934708917] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:49:49,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955805619] [2025-02-08 09:49:49,497 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:49:49,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:49:49,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:49:49,499 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-02-08 09:49:49,500 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-02-08 09:49:49,522 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 150 statements into 2 equivalence classes. [2025-02-08 09:49:49,529 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 150 statements. [2025-02-08 09:49:49,529 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 09:49:49,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:49:49,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-08 09:49:49,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:49:49,667 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2025-02-08 09:49:49,667 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:49:49,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955805619] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:49:49,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:49:49,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 21 [2025-02-08 09:49:49,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657397000] [2025-02-08 09:49:49,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:49:49,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 09:49:49,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:49:49,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 09:49:49,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2025-02-08 09:49:49,668 INFO L87 Difference]: Start difference. First operand 183 states and 197 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:49:49,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:49:49,742 INFO L93 Difference]: Finished difference Result 185 states and 199 transitions. [2025-02-08 09:49:49,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 09:49:49,746 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 150 [2025-02-08 09:49:49,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:49:49,747 INFO L225 Difference]: With dead ends: 185 [2025-02-08 09:49:49,747 INFO L226 Difference]: Without dead ends: 184 [2025-02-08 09:49:49,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2025-02-08 09:49:49,748 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 19 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:49:49,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 44 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:49:49,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-02-08 09:49:49,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2025-02-08 09:49:49,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 169 states have (on average 1.0236686390532543) internal successors, (173), 170 states have internal predecessors, (173), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-08 09:49:49,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2025-02-08 09:49:49,754 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 150 [2025-02-08 09:49:49,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:49:49,755 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2025-02-08 09:49:49,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:49:49,755 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2025-02-08 09:49:49,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-08 09:49:49,755 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:49:49,756 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1] [2025-02-08 09:49:49,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-08 09:49:49,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 09:49:49,960 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 09:49:49,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:49:49,961 INFO L85 PathProgramCache]: Analyzing trace with hash 735490912, now seen corresponding path program 3 times [2025-02-08 09:49:49,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:49:49,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612834889] [2025-02-08 09:49:49,961 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 09:49:49,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:49:49,967 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 155 statements into 8 equivalence classes. [2025-02-08 09:49:50,002 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 155 of 155 statements. [2025-02-08 09:49:50,002 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-02-08 09:49:50,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:49:50,292 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-08 09:49:50,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:49:50,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612834889] [2025-02-08 09:49:50,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612834889] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:49:50,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953344624] [2025-02-08 09:49:50,292 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 09:49:50,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:49:50,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:49:50,294 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-02-08 09:49:50,296 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-02-08 09:49:50,318 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 155 statements into 8 equivalence classes. [2025-02-08 09:49:50,327 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 155 statements. [2025-02-08 09:49:50,328 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 09:49:50,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:49:50,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 09:49:50,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:50:18,573 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= (mod (+ |ULTIMATE.start_main_~y~0#1| .cse0) 2) 0) (<= .cse0 9223372036854775807) (<= |c_ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~y~0#1| (div (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) .cse0) 2)))))) is different from true [2025-02-08 09:50:22,599 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2025-02-08 09:50:22,600 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:50:22,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953344624] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:50:22,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:50:22,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [16] total 23 [2025-02-08 09:50:22,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574455343] [2025-02-08 09:50:22,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:50:22,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 09:50:22,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:50:22,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 09:50:22,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=422, Unknown=2, NotChecked=42, Total=552 [2025-02-08 09:50:22,602 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:50:26,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-02-08 09:50:30,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:50:43,517 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 22 DAG size of output: 31 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-02-08 09:50:51,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:50:51,668 INFO L93 Difference]: Finished difference Result 184 states and 195 transitions. [2025-02-08 09:50:51,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 09:50:51,669 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 155 [2025-02-08 09:50:51,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:50:51,670 INFO L225 Difference]: With dead ends: 184 [2025-02-08 09:50:51,670 INFO L226 Difference]: Without dead ends: 183 [2025-02-08 09:50:51,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 148 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 33.2s TimeCoverageRelationStatistics Valid=116, Invalid=640, Unknown=4, NotChecked=52, Total=812 [2025-02-08 09:50:51,670 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 47 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:50:51,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 42 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 89 Invalid, 2 Unknown, 41 Unchecked, 8.1s Time] [2025-02-08 09:50:51,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-02-08 09:50:51,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2025-02-08 09:50:51,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 169 states have (on average 1.0059171597633136) internal successors, (170), 169 states have internal predecessors, (170), 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-02-08 09:50:51,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 190 transitions. [2025-02-08 09:50:51,682 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 190 transitions. Word has length 155 [2025-02-08 09:50:51,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:50:51,682 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 190 transitions. [2025-02-08 09:50:51,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:50:51,682 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 190 transitions. [2025-02-08 09:50:51,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-02-08 09:50:51,683 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:50:51,683 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1] [2025-02-08 09:50:51,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-08 09:50:51,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:50:51,884 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 09:50:51,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:50:51,885 INFO L85 PathProgramCache]: Analyzing trace with hash -860222243, now seen corresponding path program 3 times [2025-02-08 09:50:51,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:50:51,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648740649] [2025-02-08 09:50:51,885 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 09:50:51,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:50:51,892 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 216 statements into 11 equivalence classes. [2025-02-08 09:50:51,932 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 216 of 216 statements. [2025-02-08 09:50:51,932 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-08 09:50:51,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 09:50:51,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1168859061] [2025-02-08 09:50:51,933 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 09:50:51,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:50:51,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:50:51,935 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-02-08 09:50:51,937 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-02-08 09:50:51,968 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 216 statements into 11 equivalence classes. [2025-02-08 09:50:52,029 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 216 of 216 statements. [2025-02-08 09:50:52,029 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-08 09:50:52,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:50:52,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-08 09:50:52,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:50:52,311 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 0 proven. 795 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-08 09:50:52,311 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:50:52,904 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 0 proven. 795 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-08 09:50:52,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:50:52,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648740649] [2025-02-08 09:50:52,904 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 09:50:52,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168859061] [2025-02-08 09:50:52,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168859061] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:50:52,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 09:50:52,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2025-02-08 09:50:52,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738825355] [2025-02-08 09:50:52,904 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 09:50:52,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 09:50:52,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:50:52,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 09:50:52,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2025-02-08 09:50:52,906 INFO L87 Difference]: Start difference. First operand 181 states and 190 transitions. Second operand has 24 states, 23 states have (on average 14.478260869565217) internal successors, (333), 24 states have internal predecessors, (333), 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-02-08 09:50:53,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:50:53,996 INFO L93 Difference]: Finished difference Result 386 states and 418 transitions. [2025-02-08 09:50:53,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-08 09:50:53,996 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 14.478260869565217) internal successors, (333), 24 states have internal predecessors, (333), 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) Word has length 216 [2025-02-08 09:50:53,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:50:53,997 INFO L225 Difference]: With dead ends: 386 [2025-02-08 09:50:53,997 INFO L226 Difference]: Without dead ends: 385 [2025-02-08 09:50:53,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2025-02-08 09:50:53,998 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 134 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 1461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 09:50:53,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1011 Invalid, 1461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1449 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 09:50:53,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-02-08 09:50:54,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2025-02-08 09:50:54,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 361 states have (on average 1.002770083102493) internal successors, (362), 361 states have internal predecessors, (362), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-08 09:50:54,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 406 transitions. [2025-02-08 09:50:54,015 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 406 transitions. Word has length 216 [2025-02-08 09:50:54,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:50:54,015 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 406 transitions. [2025-02-08 09:50:54,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 14.478260869565217) internal successors, (333), 24 states have internal predecessors, (333), 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-02-08 09:50:54,015 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 406 transitions. [2025-02-08 09:50:54,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-02-08 09:50:54,019 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:50:54,019 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1] [2025-02-08 09:50:54,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-08 09:50:54,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:50:54,220 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 09:50:54,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:50:54,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1358296163, now seen corresponding path program 4 times [2025-02-08 09:50:54,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:50:54,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825119936] [2025-02-08 09:50:54,220 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 09:50:54,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:50:54,232 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 468 statements into 2 equivalence classes. [2025-02-08 09:50:54,280 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 468 of 468 statements. [2025-02-08 09:50:54,280 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 09:50:54,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:50:55,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4917 backedges. 3993 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-08 09:50:55,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:50:55,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825119936] [2025-02-08 09:50:55,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825119936] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:50:55,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:50:55,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2025-02-08 09:50:55,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690151316] [2025-02-08 09:50:55,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:50:55,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-08 09:50:55,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:50:55,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-08 09:50:55,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=370, Unknown=0, NotChecked=0, Total=650 [2025-02-08 09:50:55,422 INFO L87 Difference]: Start difference. First operand 385 states and 406 transitions. Second operand has 26 states, 26 states have (on average 13.884615384615385) internal successors, (361), 26 states have internal predecessors, (361), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-08 09:50:55,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:50:55,713 INFO L93 Difference]: Finished difference Result 389 states and 409 transitions. [2025-02-08 09:50:55,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 09:50:55,713 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 13.884615384615385) internal successors, (361), 26 states have internal predecessors, (361), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Word has length 468 [2025-02-08 09:50:55,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:50:55,714 INFO L225 Difference]: With dead ends: 389 [2025-02-08 09:50:55,715 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 09:50:55,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=434, Invalid=898, Unknown=0, NotChecked=0, Total=1332 [2025-02-08 09:50:55,717 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 17 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 09:50:55,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 946 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 09:50:55,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 09:50:55,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 09:50:55,718 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-02-08 09:50:55,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 09:50:55,718 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 468 [2025-02-08 09:50:55,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:50:55,718 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 09:50:55,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 13.884615384615385) internal successors, (361), 26 states have internal predecessors, (361), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-08 09:50:55,718 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 09:50:55,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 09:50:55,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2025-02-08 09:50:55,722 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2025-02-08 09:50:55,722 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2025-02-08 09:50:55,722 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2025-02-08 09:50:55,722 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2025-02-08 09:50:55,722 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2025-02-08 09:50:55,722 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2025-02-08 09:50:55,722 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2025-02-08 09:50:55,722 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2025-02-08 09:50:55,722 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2025-02-08 09:50:55,722 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2025-02-08 09:50:55,722 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2025-02-08 09:50:55,723 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2025-02-08 09:50:55,723 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2025-02-08 09:50:55,723 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2025-02-08 09:50:55,723 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2025-02-08 09:50:55,723 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2025-02-08 09:50:55,723 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2025-02-08 09:50:55,723 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2025-02-08 09:50:55,724 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2025-02-08 09:50:55,724 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2025-02-08 09:50:55,724 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2025-02-08 09:50:55,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 09:50:55,727 INFO L422 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:50:55,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 09:50:56,181 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 09:50:56,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 09:50:56 BoogieIcfgContainer [2025-02-08 09:50:56,199 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 09:50:56,199 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 09:50:56,199 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 09:50:56,200 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 09:50:56,200 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:49:41" (3/4) ... [2025-02-08 09:50:56,201 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 09:50:56,206 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-02-08 09:50:56,209 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-02-08 09:50:56,211 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 09:50:56,211 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 09:50:56,211 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 09:50:56,272 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 09:50:56,272 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 09:50:56,272 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 09:50:56,273 INFO L158 Benchmark]: Toolchain (without parser) took 74891.51ms. Allocated memory was 142.6MB in the beginning and 260.0MB in the end (delta: 117.4MB). Free memory was 106.5MB in the beginning and 223.5MB in the end (delta: -117.0MB). Peak memory consumption was 146.2MB. Max. memory is 16.1GB. [2025-02-08 09:50:56,273 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 115.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 09:50:56,274 INFO L158 Benchmark]: CACSL2BoogieTranslator took 155.66ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 96.1MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 09:50:56,274 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.14ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 94.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 09:50:56,274 INFO L158 Benchmark]: Boogie Preprocessor took 26.63ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 93.8MB in the end (delta: 754.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 09:50:56,274 INFO L158 Benchmark]: IcfgBuilder took 262.98ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 79.4MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 09:50:56,275 INFO L158 Benchmark]: TraceAbstraction took 74347.13ms. Allocated memory was 142.6MB in the beginning and 260.0MB in the end (delta: 117.4MB). Free memory was 78.7MB in the beginning and 83.3MB in the end (delta: -4.6MB). Peak memory consumption was 112.6MB. Max. memory is 16.1GB. [2025-02-08 09:50:56,276 INFO L158 Benchmark]: Witness Printer took 72.90ms. Allocated memory is still 260.0MB. Free memory was 83.3MB in the beginning and 223.5MB in the end (delta: -140.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 09:50:56,276 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.31ms. Allocated memory is still 201.3MB. Free memory is still 115.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 155.66ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 96.1MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.14ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 94.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.63ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 93.8MB in the end (delta: 754.0kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 262.98ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 79.4MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 74347.13ms. Allocated memory was 142.6MB in the beginning and 260.0MB in the end (delta: 117.4MB). Free memory was 78.7MB in the beginning and 83.3MB in the end (delta: -4.6MB). Peak memory consumption was 112.6MB. Max. memory is 16.1GB. * Witness Printer took 72.90ms. Allocated memory is still 260.0MB. Free memory was 83.3MB in the beginning and 223.5MB in the end (delta: -140.2MB). 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: 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: 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: 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: 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: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 73.8s, OverallIterations: 21, TraceHistogramMax: 23, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 32.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 732 SdHoareTripleChecker+Valid, 10.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 720 mSDsluCounter, 3497 SdHoareTripleChecker+Invalid, 9.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 41 IncrementalHoareTripleChecker+Unchecked, 2685 mSDsCounter, 106 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3576 IncrementalHoareTripleChecker+Invalid, 3725 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 106 mSolverCounterUnsat, 812 mSDtfsCounter, 3576 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1865 GetRequests, 1627 SyntacticMatches, 2 SemanticMatches, 236 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 35.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=385occurred in iteration=20, InterpolantAutomatonStates: 164, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 78 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 37.5s InterpolantComputationTime, 2664 NumberOfCodeBlocks, 2244 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 2957 ConstructedInterpolants, 4 QuantifiedInterpolants, 12430 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1440 ConjunctsInSsa, 108 ConjunctsInUnsatCore, 40 InterpolantComputations, 12 PerfectInterpolantSequences, 7079/10112 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 22 specifications checked. All of them hold - InvariantResult [Line: 27]: Location Invariant Derived location invariant: (((((((((((((((((6 == y) && (6 <= x)) && (c <= 9223372036854775806)) && (k <= ((__int128) c + 4))) && (1 <= c)) && (x <= 21)) && (k <= 10)) || (((((((2 <= x) && (1 <= c)) && (2 == y)) && (x <= 3)) && (c <= 9223372036854775805)) && (k <= 10)) && (k <= ((__int128) c + 8)))) || (((((((c <= 9223372036854775806) && (1 <= c)) && (3 == y)) && (k <= ((__int128) 7 + c))) && (k <= 10)) && (x <= 6)) && (3 <= x))) || (((((((y == 4) && (c <= 9223372036854775806)) && (1 <= c)) && (x <= 10)) && (k <= 10)) && (k <= ((__int128) 6 + c))) && (4 <= x))) || (((((((c <= 9223372036854775806) && (x <= 28)) && (7 <= x)) && (7 == y)) && (1 <= c)) && (k <= 10)) && (k <= ((__int128) 3 + c)))) || (((((((c <= 9223372036854775806) && (k <= ((__int128) c + 1))) && (1 <= c)) && (x <= 45)) && (k <= 10)) && (9 <= x)) && (9 == y))) || ((((c == 1) && (x == 1)) && (y == 1)) && (k <= ((__int128) 9 + c)))) || ((((c == 0) && (y == 0)) && (k <= 10)) && (x == 0))) || (((((((5 <= x) && (5 == y)) && (c <= 9223372036854775806)) && (1 <= c)) && (x <= 15)) && (k <= 10)) && (k <= ((__int128) 5 + c)))) || (((((((8 <= x) && (c <= 9223372036854775806)) && (x <= 36)) && (1 <= c)) && (k <= 10)) && (y == 8)) && (k <= ((__int128) 2 + c)))) || (((((((c <= 9223372036854775806) && (1 <= c)) && (x <= 55)) && (k <= 10)) && (y == 10)) && (k <= c)) && (10 <= x))) RESULT: Ultimate proved your program to be correct! [2025-02-08 09:50:56,470 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