./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench/dijkstra.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench/dijkstra.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 8c2c25cf461f08df93633b3a41b472f1ef6c33d9d6e519054ad0fbe6ddfed0fc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:47:28,319 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:47:28,366 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 01:47:28,369 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:47:28,369 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:47:28,383 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:47:28,383 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:47:28,384 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:47:28,384 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:47:28,384 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:47:28,384 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:47:28,384 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:47:28,384 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:47:28,384 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:47:28,384 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:47:28,385 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:47:28,385 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:47:28,385 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:47:28,385 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:47:28,385 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:47:28,385 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:47:28,385 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:47:28,385 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:47:28,385 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:47:28,385 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:47:28,386 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:47:28,386 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:47:28,386 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:47:28,386 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:47:28,386 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:47:28,386 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:47:28,386 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:47:28,386 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:47:28,386 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:47:28,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:47:28,386 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:47:28,387 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:47:28,387 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:47:28,387 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:47:28,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:47:28,387 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:47:28,387 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:47:28,387 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:47:28,387 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:47:28,387 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:47:28,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:47:28,388 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:47:28,388 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:47:28,388 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:47:28,388 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:47:28,388 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 -> 8c2c25cf461f08df93633b3a41b472f1ef6c33d9d6e519054ad0fbe6ddfed0fc [2025-01-10 01:47:28,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:47:28,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:47:28,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:47:28,602 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:47:28,602 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:47:28,603 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench/dijkstra.c [2025-01-10 01:47:29,735 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/71aca1739/03e2d227a14b4f0891840c8a4be2ef9f/FLAG04f074399 [2025-01-10 01:47:30,025 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:47:30,027 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench/dijkstra.c [2025-01-10 01:47:30,041 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/71aca1739/03e2d227a14b4f0891840c8a4be2ef9f/FLAG04f074399 [2025-01-10 01:47:30,324 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/71aca1739/03e2d227a14b4f0891840c8a4be2ef9f [2025-01-10 01:47:30,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:47:30,328 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:47:30,329 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:47:30,329 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:47:30,332 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:47:30,333 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:47:30" (1/1) ... [2025-01-10 01:47:30,334 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ca01079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:47:30, skipping insertion in model container [2025-01-10 01:47:30,334 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:47:30" (1/1) ... [2025-01-10 01:47:30,358 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:47:30,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:47:30,560 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:47:30,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:47:30,602 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:47:30,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:47:30 WrapperNode [2025-01-10 01:47:30,604 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:47:30,605 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:47:30,605 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:47:30,605 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:47:30,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:47:30" (1/1) ... [2025-01-10 01:47:30,617 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:47:30" (1/1) ... [2025-01-10 01:47:30,653 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 310 [2025-01-10 01:47:30,656 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:47:30,656 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:47:30,656 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:47:30,656 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:47:30,664 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:47:30" (1/1) ... [2025-01-10 01:47:30,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:47:30" (1/1) ... [2025-01-10 01:47:30,666 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:47:30" (1/1) ... [2025-01-10 01:47:30,689 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 01:47:30,690 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:47:30" (1/1) ... [2025-01-10 01:47:30,690 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:47:30" (1/1) ... [2025-01-10 01:47:30,698 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:47:30" (1/1) ... [2025-01-10 01:47:30,699 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:47:30" (1/1) ... [2025-01-10 01:47:30,704 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:47:30" (1/1) ... [2025-01-10 01:47:30,705 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:47:30" (1/1) ... [2025-01-10 01:47:30,709 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:47:30" (1/1) ... [2025-01-10 01:47:30,715 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:47:30,716 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:47:30,717 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:47:30,718 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:47:30,718 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:47:30" (1/1) ... [2025-01-10 01:47:30,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:47:30,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:30,746 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:47:30,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:47:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:47:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:47:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:47:30,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:47:30,766 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 01:47:30,766 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 01:47:30,807 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:47:30,808 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:47:31,846 INFO L? ?]: Removed 585 outVars from TransFormulas that were not future-live. [2025-01-10 01:47:31,847 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:47:31,868 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:47:31,871 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 01:47:31,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:47:31 BoogieIcfgContainer [2025-01-10 01:47:31,872 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:47:31,874 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:47:31,874 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:47:31,877 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:47:31,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:47:30" (1/3) ... [2025-01-10 01:47:31,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64abfd9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:47:31, skipping insertion in model container [2025-01-10 01:47:31,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:47:30" (2/3) ... [2025-01-10 01:47:31,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64abfd9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:47:31, skipping insertion in model container [2025-01-10 01:47:31,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:47:31" (3/3) ... [2025-01-10 01:47:31,880 INFO L128 eAbstractionObserver]: Analyzing ICFG dijkstra.c [2025-01-10 01:47:31,892 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:47:31,894 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dijkstra.c that has 2 procedures, 540 locations, 1 initial locations, 2 loop locations, and 258 error locations. [2025-01-10 01:47:31,955 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:47:31,965 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;@5dfd3768, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:47:31,965 INFO L334 AbstractCegarLoop]: Starting to check reachability of 258 error locations. [2025-01-10 01:47:31,969 INFO L276 IsEmpty]: Start isEmpty. Operand has 540 states, 271 states have (on average 1.9741697416974169) internal successors, (535), 529 states have internal predecessors, (535), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 01:47:31,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 01:47:31,973 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:31,973 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 01:47:31,973 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 255 more)] === [2025-01-10 01:47:31,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:31,978 INFO L85 PathProgramCache]: Analyzing trace with hash 925959, now seen corresponding path program 1 times [2025-01-10 01:47:31,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:31,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972665355] [2025-01-10 01:47:31,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:31,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:32,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:47:32,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:47:32,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:32,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:32,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:32,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:32,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972665355] [2025-01-10 01:47:32,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972665355] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:47:32,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:47:32,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:47:32,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487463799] [2025-01-10 01:47:32,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:47:32,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 01:47:32,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:32,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 01:47:32,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 01:47:32,098 INFO L87 Difference]: Start difference. First operand has 540 states, 271 states have (on average 1.9741697416974169) internal successors, (535), 529 states have internal predecessors, (535), 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) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:32,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:32,150 INFO L93 Difference]: Finished difference Result 1060 states and 1105 transitions. [2025-01-10 01:47:32,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 01:47:32,152 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-10 01:47:32,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:32,162 INFO L225 Difference]: With dead ends: 1060 [2025-01-10 01:47:32,162 INFO L226 Difference]: Without dead ends: 521 [2025-01-10 01:47:32,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 01:47:32,172 INFO L435 NwaCegarLoop]: 537 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, 537 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:32,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:47:32,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-01-10 01:47:32,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 521. [2025-01-10 01:47:32,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 266 states have (on average 1.9323308270676691) internal successors, (514), 511 states have internal predecessors, (514), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 01:47:32,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 530 transitions. [2025-01-10 01:47:32,236 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 530 transitions. Word has length 4 [2025-01-10 01:47:32,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:32,236 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 530 transitions. [2025-01-10 01:47:32,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:32,237 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 530 transitions. [2025-01-10 01:47:32,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 01:47:32,237 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:32,237 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 01:47:32,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:47:32,238 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 255 more)] === [2025-01-10 01:47:32,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:32,238 INFO L85 PathProgramCache]: Analyzing trace with hash 925711, now seen corresponding path program 1 times [2025-01-10 01:47:32,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:32,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886333205] [2025-01-10 01:47:32,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:32,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:32,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:47:32,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:47:32,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:32,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:32,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:32,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:32,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886333205] [2025-01-10 01:47:32,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886333205] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:47:32,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:47:32,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:47:32,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776999480] [2025-01-10 01:47:32,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:47:32,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:47:32,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:32,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:47:32,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:47:32,293 INFO L87 Difference]: Start difference. First operand 521 states and 530 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:33,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:33,113 INFO L93 Difference]: Finished difference Result 955 states and 1045 transitions. [2025-01-10 01:47:33,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:47:33,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-10 01:47:33,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:33,117 INFO L225 Difference]: With dead ends: 955 [2025-01-10 01:47:33,117 INFO L226 Difference]: Without dead ends: 894 [2025-01-10 01:47:33,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:47:33,118 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 369 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:33,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 578 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 01:47:33,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2025-01-10 01:47:33,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 779. [2025-01-10 01:47:33,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 516 states have (on average 1.823643410852713) internal successors, (941), 761 states have internal predecessors, (941), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 01:47:33,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 973 transitions. [2025-01-10 01:47:33,152 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 973 transitions. Word has length 4 [2025-01-10 01:47:33,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:33,152 INFO L471 AbstractCegarLoop]: Abstraction has 779 states and 973 transitions. [2025-01-10 01:47:33,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:33,152 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 973 transitions. [2025-01-10 01:47:33,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 01:47:33,152 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:33,152 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 01:47:33,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:47:33,152 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 255 more)] === [2025-01-10 01:47:33,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:33,153 INFO L85 PathProgramCache]: Analyzing trace with hash 925764, now seen corresponding path program 1 times [2025-01-10 01:47:33,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:33,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506670732] [2025-01-10 01:47:33,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:33,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:33,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:47:33,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:47:33,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:33,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:33,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:33,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:33,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506670732] [2025-01-10 01:47:33,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506670732] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:47:33,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:47:33,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:47:33,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6450812] [2025-01-10 01:47:33,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:47:33,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:47:33,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:33,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:47:33,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:47:33,200 INFO L87 Difference]: Start difference. First operand 779 states and 973 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:33,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:33,829 INFO L93 Difference]: Finished difference Result 1777 states and 2259 transitions. [2025-01-10 01:47:33,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:47:33,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-10 01:47:33,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:33,834 INFO L225 Difference]: With dead ends: 1777 [2025-01-10 01:47:33,836 INFO L226 Difference]: Without dead ends: 1003 [2025-01-10 01:47:33,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:47:33,838 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 216 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:33,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 629 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 01:47:33,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2025-01-10 01:47:33,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 965. [2025-01-10 01:47:33,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 696 states have (on average 1.7844827586206897) internal successors, (1242), 941 states have internal predecessors, (1242), 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-01-10 01:47:33,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1286 transitions. [2025-01-10 01:47:33,866 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1286 transitions. Word has length 4 [2025-01-10 01:47:33,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:33,866 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1286 transitions. [2025-01-10 01:47:33,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:33,866 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1286 transitions. [2025-01-10 01:47:33,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 01:47:33,866 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:33,866 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:47:33,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:47:33,867 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 255 more)] === [2025-01-10 01:47:33,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:33,867 INFO L85 PathProgramCache]: Analyzing trace with hash 889609969, now seen corresponding path program 1 times [2025-01-10 01:47:33,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:33,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67628243] [2025-01-10 01:47:33,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:33,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:33,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:47:33,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:47:33,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:33,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:33,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:33,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:33,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67628243] [2025-01-10 01:47:33,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67628243] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:47:33,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:47:33,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:47:33,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708316981] [2025-01-10 01:47:33,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:47:33,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:47:33,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:33,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:47:33,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:47:33,906 INFO L87 Difference]: Start difference. First operand 965 states and 1286 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:34,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:34,718 INFO L93 Difference]: Finished difference Result 1003 states and 1286 transitions. [2025-01-10 01:47:34,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:47:34,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-10 01:47:34,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:34,722 INFO L225 Difference]: With dead ends: 1003 [2025-01-10 01:47:34,723 INFO L226 Difference]: Without dead ends: 1001 [2025-01-10 01:47:34,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:47:34,725 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 212 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:34,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 467 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 01:47:34,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2025-01-10 01:47:34,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 965. [2025-01-10 01:47:34,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 696 states have (on average 1.7816091954022988) internal successors, (1240), 941 states have internal predecessors, (1240), 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-01-10 01:47:34,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1284 transitions. [2025-01-10 01:47:34,752 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1284 transitions. Word has length 6 [2025-01-10 01:47:34,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:34,752 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1284 transitions. [2025-01-10 01:47:34,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:34,753 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1284 transitions. [2025-01-10 01:47:34,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:47:34,754 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:34,754 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 01:47:34,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:47:34,754 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 255 more)] === [2025-01-10 01:47:34,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:34,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1809675114, now seen corresponding path program 1 times [2025-01-10 01:47:34,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:34,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111366790] [2025-01-10 01:47:34,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:34,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:34,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:47:34,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:47:34,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:34,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:34,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:34,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:34,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111366790] [2025-01-10 01:47:34,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111366790] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:34,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839555591] [2025-01-10 01:47:34,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:34,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:34,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:34,792 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:47:34,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:47:34,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:47:34,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:47:34,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:34,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:34,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:47:34,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:34,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:34,843 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:47:34,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839555591] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:47:34,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:47:34,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 01:47:34,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835719370] [2025-01-10 01:47:34,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:47:34,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:47:34,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:34,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:47:34,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:47:34,844 INFO L87 Difference]: Start difference. First operand 965 states and 1284 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:36,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:36,219 INFO L93 Difference]: Finished difference Result 1759 states and 2425 transitions. [2025-01-10 01:47:36,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:47:36,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-10 01:47:36,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:36,225 INFO L225 Difference]: With dead ends: 1759 [2025-01-10 01:47:36,225 INFO L226 Difference]: Without dead ends: 1628 [2025-01-10 01:47:36,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:47:36,226 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 471 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:36,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 853 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-10 01:47:36,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2025-01-10 01:47:36,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1526. [2025-01-10 01:47:36,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1240 states have (on average 1.775) internal successors, (2201), 1484 states have internal predecessors, (2201), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-10 01:47:36,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 2281 transitions. [2025-01-10 01:47:36,289 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 2281 transitions. Word has length 7 [2025-01-10 01:47:36,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:36,289 INFO L471 AbstractCegarLoop]: Abstraction has 1526 states and 2281 transitions. [2025-01-10 01:47:36,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:36,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 2281 transitions. [2025-01-10 01:47:36,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:47:36,292 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:36,292 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-01-10 01:47:36,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:47:36,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:36,494 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 255 more)] === [2025-01-10 01:47:36,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:36,494 INFO L85 PathProgramCache]: Analyzing trace with hash 265353730, now seen corresponding path program 1 times [2025-01-10 01:47:36,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:36,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942933489] [2025-01-10 01:47:36,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:36,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:36,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:47:36,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:47:36,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:36,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:36,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:36,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:36,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942933489] [2025-01-10 01:47:36,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942933489] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:36,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461645097] [2025-01-10 01:47:36,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:36,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:36,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:36,547 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:47:36,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:47:36,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:47:36,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:47:36,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:36,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:36,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:47:36,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:36,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:36,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:36,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:36,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461645097] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:47:36,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:47:36,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 01:47:36,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171288107] [2025-01-10 01:47:36,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:47:36,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:47:36,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:36,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:47:36,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:47:36,619 INFO L87 Difference]: Start difference. First operand 1526 states and 2281 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:37,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:37,622 INFO L93 Difference]: Finished difference Result 2910 states and 4394 transitions. [2025-01-10 01:47:37,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:47:37,622 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 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 8 [2025-01-10 01:47:37,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:37,632 INFO L225 Difference]: With dead ends: 2910 [2025-01-10 01:47:37,632 INFO L226 Difference]: Without dead ends: 2907 [2025-01-10 01:47:37,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:47:37,634 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 1901 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1928 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:37,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1928 Valid, 1121 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 984 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-10 01:47:37,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2025-01-10 01:47:37,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 1533. [2025-01-10 01:47:37,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1249 states have (on average 1.765412329863891) internal successors, (2205), 1491 states have internal predecessors, (2205), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-10 01:47:37,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 2285 transitions. [2025-01-10 01:47:37,700 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 2285 transitions. Word has length 8 [2025-01-10 01:47:37,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:37,700 INFO L471 AbstractCegarLoop]: Abstraction has 1533 states and 2285 transitions. [2025-01-10 01:47:37,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:37,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 2285 transitions. [2025-01-10 01:47:37,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 01:47:37,701 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:37,701 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:37,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:47:37,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:37,901 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 255 more)] === [2025-01-10 01:47:37,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:37,902 INFO L85 PathProgramCache]: Analyzing trace with hash -364019561, now seen corresponding path program 1 times [2025-01-10 01:47:37,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:37,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435480906] [2025-01-10 01:47:37,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:37,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:37,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:47:37,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:47:37,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:37,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:38,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:38,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:38,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435480906] [2025-01-10 01:47:38,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435480906] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:38,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425815788] [2025-01-10 01:47:38,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:38,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:38,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:38,013 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:47:38,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:47:38,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:47:38,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:47:38,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:38,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:38,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:47:38,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:38,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:38,088 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:47:38,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425815788] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:47:38,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:47:38,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-10 01:47:38,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318923744] [2025-01-10 01:47:38,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:47:38,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:47:38,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:38,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:47:38,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:47:38,090 INFO L87 Difference]: Start difference. First operand 1533 states and 2285 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:39,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:39,641 INFO L93 Difference]: Finished difference Result 1623 states and 2287 transitions. [2025-01-10 01:47:39,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:47:39,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-10 01:47:39,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:39,646 INFO L225 Difference]: With dead ends: 1623 [2025-01-10 01:47:39,646 INFO L226 Difference]: Without dead ends: 1609 [2025-01-10 01:47:39,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:47:39,647 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 441 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:39,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 599 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-10 01:47:39,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2025-01-10 01:47:39,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1533. [2025-01-10 01:47:39,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1249 states have (on average 1.7526020816653323) internal successors, (2189), 1491 states have internal predecessors, (2189), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-10 01:47:39,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 2269 transitions. [2025-01-10 01:47:39,671 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 2269 transitions. Word has length 9 [2025-01-10 01:47:39,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:39,671 INFO L471 AbstractCegarLoop]: Abstraction has 1533 states and 2269 transitions. [2025-01-10 01:47:39,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:39,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 2269 transitions. [2025-01-10 01:47:39,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 01:47:39,672 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:39,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:39,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:47:39,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:39,873 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 255 more)] === [2025-01-10 01:47:39,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:39,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1600295554, now seen corresponding path program 1 times [2025-01-10 01:47:39,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:39,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240451608] [2025-01-10 01:47:39,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:39,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:39,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:47:39,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:47:39,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:39,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:39,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:39,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:39,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240451608] [2025-01-10 01:47:39,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240451608] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:39,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960239696] [2025-01-10 01:47:39,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:39,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:39,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:39,964 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:47:39,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 01:47:39,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:47:39,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:47:39,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:39,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:39,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:47:39,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:40,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:40,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:40,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:40,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960239696] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:47:40,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:47:40,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-01-10 01:47:40,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544365499] [2025-01-10 01:47:40,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:47:40,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:47:40,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:40,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:47:40,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:47:40,097 INFO L87 Difference]: Start difference. First operand 1533 states and 2269 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:41,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 01:47:43,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:43,481 INFO L93 Difference]: Finished difference Result 2812 states and 4255 transitions. [2025-01-10 01:47:43,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:47:43,481 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-10 01:47:43,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:43,489 INFO L225 Difference]: With dead ends: 2812 [2025-01-10 01:47:43,489 INFO L226 Difference]: Without dead ends: 2809 [2025-01-10 01:47:43,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=47, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:47:43,490 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 1177 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 2845 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1195 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 2869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:43,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1195 Valid, 1242 Invalid, 2869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2845 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-01-10 01:47:43,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2809 states. [2025-01-10 01:47:43,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2809 to 2117. [2025-01-10 01:47:43,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2117 states, 1815 states have (on average 1.725068870523416) internal successors, (3131), 2057 states have internal predecessors, (3131), 58 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-10 01:47:43,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 3247 transitions. [2025-01-10 01:47:43,553 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 3247 transitions. Word has length 10 [2025-01-10 01:47:43,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:43,553 INFO L471 AbstractCegarLoop]: Abstraction has 2117 states and 3247 transitions. [2025-01-10 01:47:43,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:43,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 3247 transitions. [2025-01-10 01:47:43,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 01:47:43,553 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:43,554 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:43,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 01:47:43,755 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,SelfDestructingSolverStorable7 [2025-01-10 01:47:43,755 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 255 more)] === [2025-01-10 01:47:43,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:43,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1182274142, now seen corresponding path program 1 times [2025-01-10 01:47:43,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:43,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827646323] [2025-01-10 01:47:43,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:43,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:43,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:47:43,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:47:43,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:43,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 01:47:43,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1041161111] [2025-01-10 01:47:43,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:43,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:43,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:43,781 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:47:43,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 01:47:43,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:47:43,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:47:43,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:43,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:43,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:47:43,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:43,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:43,851 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:47:43,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:43,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827646323] [2025-01-10 01:47:43,852 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 01:47:43,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041161111] [2025-01-10 01:47:43,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041161111] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:47:43,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:47:43,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:47:43,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210197875] [2025-01-10 01:47:43,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:47:43,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:47:43,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:43,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:47:43,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:47:43,854 INFO L87 Difference]: Start difference. First operand 2117 states and 3247 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:47:44,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:44,511 INFO L93 Difference]: Finished difference Result 2157 states and 3247 transitions. [2025-01-10 01:47:44,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:47:44,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 15 [2025-01-10 01:47:44,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:44,517 INFO L225 Difference]: With dead ends: 2157 [2025-01-10 01:47:44,517 INFO L226 Difference]: Without dead ends: 2153 [2025-01-10 01:47:44,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:47:44,518 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 208 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:44,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 565 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 01:47:44,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2153 states. [2025-01-10 01:47:44,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2153 to 2117. [2025-01-10 01:47:44,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2117 states, 1815 states have (on average 1.7228650137741046) internal successors, (3127), 2057 states have internal predecessors, (3127), 58 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-10 01:47:44,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 3243 transitions. [2025-01-10 01:47:44,569 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 3243 transitions. Word has length 15 [2025-01-10 01:47:44,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:44,569 INFO L471 AbstractCegarLoop]: Abstraction has 2117 states and 3243 transitions. [2025-01-10 01:47:44,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:47:44,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 3243 transitions. [2025-01-10 01:47:44,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 01:47:44,571 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:44,571 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:44,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 01:47:44,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:44,772 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 255 more)] === [2025-01-10 01:47:44,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:44,772 INFO L85 PathProgramCache]: Analyzing trace with hash 2004207328, now seen corresponding path program 1 times [2025-01-10 01:47:44,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:44,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466027056] [2025-01-10 01:47:44,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:44,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:44,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:47:44,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:47:44,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:44,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 01:47:44,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [173298724] [2025-01-10 01:47:44,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:44,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:44,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:44,782 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:47:44,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 01:47:44,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:47:44,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:47:44,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:44,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:44,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:47:44,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:44,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:44,838 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:47:44,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:44,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466027056] [2025-01-10 01:47:44,838 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 01:47:44,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173298724] [2025-01-10 01:47:44,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173298724] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:47:44,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:47:44,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:47:44,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174989188] [2025-01-10 01:47:44,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:47:44,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:47:44,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:44,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:47:44,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:47:44,841 INFO L87 Difference]: Start difference. First operand 2117 states and 3243 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:47:45,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:45,378 INFO L93 Difference]: Finished difference Result 2156 states and 3243 transitions. [2025-01-10 01:47:45,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:47:45,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 16 [2025-01-10 01:47:45,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:45,384 INFO L225 Difference]: With dead ends: 2156 [2025-01-10 01:47:45,384 INFO L226 Difference]: Without dead ends: 2153 [2025-01-10 01:47:45,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:47:45,385 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 207 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:45,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 568 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 01:47:45,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2153 states. [2025-01-10 01:47:45,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2153 to 2117. [2025-01-10 01:47:45,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2117 states, 1815 states have (on average 1.7212121212121212) internal successors, (3124), 2057 states have internal predecessors, (3124), 58 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-10 01:47:45,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 3240 transitions. [2025-01-10 01:47:45,437 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 3240 transitions. Word has length 16 [2025-01-10 01:47:45,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:45,437 INFO L471 AbstractCegarLoop]: Abstraction has 2117 states and 3240 transitions. [2025-01-10 01:47:45,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:47:45,438 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 3240 transitions. [2025-01-10 01:47:45,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 01:47:45,438 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:45,438 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:45,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 01:47:45,639 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,SelfDestructingSolverStorable9 [2025-01-10 01:47:45,639 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 255 more)] === [2025-01-10 01:47:45,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:45,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1897895778, now seen corresponding path program 1 times [2025-01-10 01:47:45,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:45,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042019934] [2025-01-10 01:47:45,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:45,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:45,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:47:45,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:47:45,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:45,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 01:47:45,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1816677842] [2025-01-10 01:47:45,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:45,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:45,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:45,649 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:47:45,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 01:47:45,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:47:45,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:47:45,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:45,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:45,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:47:45,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:45,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:45,703 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:47:45,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:45,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042019934] [2025-01-10 01:47:45,703 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 01:47:45,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816677842] [2025-01-10 01:47:45,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816677842] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:47:45,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:47:45,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:47:45,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86489517] [2025-01-10 01:47:45,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:47:45,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:47:45,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:45,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:47:45,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:47:45,704 INFO L87 Difference]: Start difference. First operand 2117 states and 3240 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:47:46,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:46,729 INFO L93 Difference]: Finished difference Result 2232 states and 3251 transitions. [2025-01-10 01:47:46,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:47:46,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 18 [2025-01-10 01:47:46,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:46,735 INFO L225 Difference]: With dead ends: 2232 [2025-01-10 01:47:46,735 INFO L226 Difference]: Without dead ends: 2229 [2025-01-10 01:47:46,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:47:46,736 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 578 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:46,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 518 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-10 01:47:46,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2229 states. [2025-01-10 01:47:46,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2229 to 2117. [2025-01-10 01:47:46,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2117 states, 1815 states have (on average 1.7118457300275483) internal successors, (3107), 2057 states have internal predecessors, (3107), 58 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-10 01:47:46,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 3223 transitions. [2025-01-10 01:47:46,767 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 3223 transitions. Word has length 18 [2025-01-10 01:47:46,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:46,768 INFO L471 AbstractCegarLoop]: Abstraction has 2117 states and 3223 transitions. [2025-01-10 01:47:46,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:47:46,768 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 3223 transitions. [2025-01-10 01:47:46,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 01:47:46,768 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:46,768 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:46,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 01:47:46,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:46,973 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 255 more)] === [2025-01-10 01:47:46,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:46,973 INFO L85 PathProgramCache]: Analyzing trace with hash -480950596, now seen corresponding path program 1 times [2025-01-10 01:47:46,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:46,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963583329] [2025-01-10 01:47:46,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:46,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:46,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:47:46,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:47:46,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:46,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 01:47:46,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1720553966] [2025-01-10 01:47:46,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:46,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:46,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:46,984 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:47:46,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 01:47:47,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:47:47,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:47:47,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:47,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:47,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:47:47,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:47,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:47,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:47,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:47,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:47,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963583329] [2025-01-10 01:47:47,172 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 01:47:47,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720553966] [2025-01-10 01:47:47,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720553966] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:47:47,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:47:47,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-01-10 01:47:47,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219558241] [2025-01-10 01:47:47,173 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 01:47:47,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:47:47,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:47,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:47:47,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:47:47,173 INFO L87 Difference]: Start difference. First operand 2117 states and 3223 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:47:51,958 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 [1] [2025-01-10 01:47:57,034 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 [1] [2025-01-10 01:48:01,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-10 01:48:10,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 7.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 01:48:16,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 01:48:21,493 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 [1] [2025-01-10 01:48:25,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-10 01:48:29,503 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 [1] [2025-01-10 01:48:33,507 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 [1] [2025-01-10 01:48:37,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-10 01:48:41,518 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 [1] [2025-01-10 01:48:43,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-10 01:48:45,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-10 01:48:47,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-10 01:48:49,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-10 01:48:53,747 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 [1] [2025-01-10 01:48:57,750 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 [1] [2025-01-10 01:49:01,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-10 01:49:05,761 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 [1] [2025-01-10 01:49:09,765 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 [1] [2025-01-10 01:49:13,768 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 [1]