./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/ldv-regression/test22-1.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/ldv-regression/test22-1.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 e1ce1c36cc17bb5fac8e93fbe54fbc2a77334d62ad40c06c722f9da96af2516f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:38:01,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:38:01,643 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:38:01,648 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:38:01,650 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:38:01,669 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:38:01,669 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:38:01,670 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:38:01,670 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:38:01,670 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:38:01,670 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:38:01,670 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:38:01,670 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:38:01,670 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:38:01,671 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:38:01,671 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:38:01,671 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:38:01,671 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:38:01,671 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:38:01,671 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:38:01,671 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:38:01,671 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:38:01,671 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:38:01,671 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:38:01,671 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:38:01,672 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:38:01,672 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:38:01,672 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:38:01,672 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:38:01,672 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:38:01,672 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:38:01,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:38:01,672 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:38:01,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:38:01,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:38:01,672 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:38:01,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:38:01,672 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:38:01,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:38:01,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:38:01,672 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:38:01,672 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:38:01,673 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:38:01,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:38:01,673 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:38:01,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:38:01,673 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:38:01,673 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:38:01,673 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:38:01,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:38:01,673 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 -> e1ce1c36cc17bb5fac8e93fbe54fbc2a77334d62ad40c06c722f9da96af2516f [2025-01-10 01:38:01,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:38:01,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:38:01,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:38:01,929 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:38:01,929 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:38:01,930 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test22-1.c [2025-01-10 01:38:03,183 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f8953ea25/e913e4ee82914d55a150b9823615a188/FLAGa6531a667 [2025-01-10 01:38:03,448 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:38:03,449 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-regression/test22-1.c [2025-01-10 01:38:03,456 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f8953ea25/e913e4ee82914d55a150b9823615a188/FLAGa6531a667 [2025-01-10 01:38:03,745 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f8953ea25/e913e4ee82914d55a150b9823615a188 [2025-01-10 01:38:03,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:38:03,750 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:38:03,753 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:38:03,753 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:38:03,756 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:38:03,756 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:38:03" (1/1) ... [2025-01-10 01:38:03,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@263008b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:03, skipping insertion in model container [2025-01-10 01:38:03,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:38:03" (1/1) ... [2025-01-10 01:38:03,767 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:38:03,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:38:03,907 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:38:03,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:38:03,931 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:38:03,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:03 WrapperNode [2025-01-10 01:38:03,933 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:38:03,934 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:38:03,934 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:38:03,934 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:38:03,942 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:38:03" (1/1) ... [2025-01-10 01:38:03,946 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:38:03" (1/1) ... [2025-01-10 01:38:03,959 INFO L138 Inliner]: procedures = 16, calls = 27, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 95 [2025-01-10 01:38:03,959 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:38:03,960 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:38:03,960 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:38:03,960 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:38:03,965 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:03" (1/1) ... [2025-01-10 01:38:03,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:03" (1/1) ... [2025-01-10 01:38:03,966 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:03" (1/1) ... [2025-01-10 01:38:03,973 INFO L175 MemorySlicer]: Split 14 memory accesses to 2 slices as follows [2, 12]. 86 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 4 writes are split as follows [0, 4]. [2025-01-10 01:38:03,974 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:03" (1/1) ... [2025-01-10 01:38:03,974 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:03" (1/1) ... [2025-01-10 01:38:03,977 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:03" (1/1) ... [2025-01-10 01:38:03,977 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:03" (1/1) ... [2025-01-10 01:38:03,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:03" (1/1) ... [2025-01-10 01:38:03,979 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:03" (1/1) ... [2025-01-10 01:38:03,980 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:03" (1/1) ... [2025-01-10 01:38:03,980 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:38:03,981 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:38:03,981 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:38:03,981 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:38:03,982 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:03" (1/1) ... [2025-01-10 01:38:03,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:38:03,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:38:04,003 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:38:04,008 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:38:04,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:38:04,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:38:04,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:38:04,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:38:04,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:38:04,023 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2025-01-10 01:38:04,023 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2025-01-10 01:38:04,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:38:04,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:38:04,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:38:04,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:38:04,071 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:38:04,073 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:38:04,183 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-01-10 01:38:04,183 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:38:04,190 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:38:04,190 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 01:38:04,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:38:04 BoogieIcfgContainer [2025-01-10 01:38:04,191 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:38:04,192 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:38:04,192 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:38:04,195 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:38:04,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:38:03" (1/3) ... [2025-01-10 01:38:04,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cf71776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:38:04, skipping insertion in model container [2025-01-10 01:38:04,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:38:03" (2/3) ... [2025-01-10 01:38:04,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cf71776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:38:04, skipping insertion in model container [2025-01-10 01:38:04,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:38:04" (3/3) ... [2025-01-10 01:38:04,197 INFO L128 eAbstractionObserver]: Analyzing ICFG test22-1.c [2025-01-10 01:38:04,206 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:38:04,208 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test22-1.c that has 2 procedures, 33 locations, 1 initial locations, 1 loop locations, and 4 error locations. [2025-01-10 01:38:04,246 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:38:04,253 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;@4b0830fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:38:04,253 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-10 01:38:04,256 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 24 states have (on average 1.375) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:38:04,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 01:38:04,260 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:38:04,260 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:38:04,260 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:38:04,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:38:04,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1920858197, now seen corresponding path program 1 times [2025-01-10 01:38:04,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:38:04,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511680051] [2025-01-10 01:38:04,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:04,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:38:04,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:38:04,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:38:04,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:04,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:04,464 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:38:04,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:38:04,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511680051] [2025-01-10 01:38:04,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511680051] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:38:04,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:38:04,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:38:04,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583551554] [2025-01-10 01:38:04,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:38:04,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:38:04,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:38:04,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:38:04,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:38:04,485 INFO L87 Difference]: Start difference. First operand has 33 states, 24 states have (on average 1.375) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 01:38:04,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:38:04,515 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2025-01-10 01:38:04,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:38:04,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2025-01-10 01:38:04,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:38:04,522 INFO L225 Difference]: With dead ends: 52 [2025-01-10 01:38:04,522 INFO L226 Difference]: Without dead ends: 24 [2025-01-10 01:38:04,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:38:04,526 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:38:04,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:38:04,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-01-10 01:38:04,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-01-10 01:38:04,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.25) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:38:04,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2025-01-10 01:38:04,554 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2025-01-10 01:38:04,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:38:04,554 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2025-01-10 01:38:04,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 01:38:04,555 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2025-01-10 01:38:04,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 01:38:04,556 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:38:04,556 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:38:04,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:38:04,557 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:38:04,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:38:04,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1920860119, now seen corresponding path program 1 times [2025-01-10 01:38:04,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:38:04,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579186240] [2025-01-10 01:38:04,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:04,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:38:04,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:38:04,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:38:04,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:04,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:04,774 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:38:04,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:38:04,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579186240] [2025-01-10 01:38:04,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579186240] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:38:04,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:38:04,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:38:04,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969602721] [2025-01-10 01:38:04,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:38:04,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:38:04,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:38:04,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:38:04,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:38:04,777 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 01:38:04,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:38:04,815 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2025-01-10 01:38:04,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:38:04,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2025-01-10 01:38:04,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:38:04,816 INFO L225 Difference]: With dead ends: 24 [2025-01-10 01:38:04,816 INFO L226 Difference]: Without dead ends: 23 [2025-01-10 01:38:04,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:38:04,817 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 10 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:38:04,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 49 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:38:04,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-01-10 01:38:04,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-01-10 01:38:04,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:38:04,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2025-01-10 01:38:04,823 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 21 [2025-01-10 01:38:04,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:38:04,823 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2025-01-10 01:38:04,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 01:38:04,823 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2025-01-10 01:38:04,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 01:38:04,824 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:38:04,824 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:38:04,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:38:04,824 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:38:04,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:38:04,825 INFO L85 PathProgramCache]: Analyzing trace with hash 582878510, now seen corresponding path program 1 times [2025-01-10 01:38:04,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:38:04,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950140997] [2025-01-10 01:38:04,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:04,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:38:04,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:38:04,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:38:04,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:04,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:05,420 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:38:05,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:38:05,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950140997] [2025-01-10 01:38:05,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950140997] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:38:05,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090853376] [2025-01-10 01:38:05,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:05,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:38:05,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:38:05,430 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:38:05,431 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:38:05,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:38:05,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:38:05,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:05,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:05,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-10 01:38:05,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:38:05,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2025-01-10 01:38:05,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 01:38:05,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2025-01-10 01:38:06,056 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 01:38:06,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:38:06,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 26 [2025-01-10 01:38:06,107 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:38:06,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:38:06,551 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:38:06,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090853376] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:38:06,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:38:06,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 21 [2025-01-10 01:38:06,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738453319] [2025-01-10 01:38:06,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:38:06,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 01:38:06,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:38:06,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 01:38:06,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2025-01-10 01:38:06,553 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 19 states have internal predecessors, (39), 6 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2025-01-10 01:38:06,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:38:06,737 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2025-01-10 01:38:06,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:38:06,737 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 19 states have internal predecessors, (39), 6 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) Word has length 22 [2025-01-10 01:38:06,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:38:06,738 INFO L225 Difference]: With dead ends: 23 [2025-01-10 01:38:06,738 INFO L226 Difference]: Without dead ends: 22 [2025-01-10 01:38:06,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2025-01-10 01:38:06,739 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 42 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:38:06,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 67 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:38:06,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-01-10 01:38:06,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-01-10 01:38:06,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:38:06,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2025-01-10 01:38:06,745 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 22 [2025-01-10 01:38:06,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:38:06,746 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2025-01-10 01:38:06,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 19 states have internal predecessors, (39), 6 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2025-01-10 01:38:06,746 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2025-01-10 01:38:06,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 01:38:06,746 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:38:06,747 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:38:06,756 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:38:06,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:38:06,951 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:38:06,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:38:06,951 INFO L85 PathProgramCache]: Analyzing trace with hash -19027630, now seen corresponding path program 1 times [2025-01-10 01:38:06,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:38:06,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426648658] [2025-01-10 01:38:06,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:06,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:38:06,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:38:06,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:38:06,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:06,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:06,998 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:38:06,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:38:06,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426648658] [2025-01-10 01:38:06,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426648658] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:38:06,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:38:06,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:38:06,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414194394] [2025-01-10 01:38:06,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:38:06,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:38:06,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:38:06,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:38:06,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:38:06,999 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 01:38:07,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:38:07,012 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2025-01-10 01:38:07,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:38:07,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2025-01-10 01:38:07,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:38:07,013 INFO L225 Difference]: With dead ends: 22 [2025-01-10 01:38:07,013 INFO L226 Difference]: Without dead ends: 21 [2025-01-10 01:38:07,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:38:07,014 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:38:07,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 49 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:38:07,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-01-10 01:38:07,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-01-10 01:38:07,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:38:07,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2025-01-10 01:38:07,017 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 25 [2025-01-10 01:38:07,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:38:07,017 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2025-01-10 01:38:07,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 01:38:07,017 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2025-01-10 01:38:07,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-10 01:38:07,017 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:38:07,017 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:38:07,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:38:07,018 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:38:07,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:38:07,018 INFO L85 PathProgramCache]: Analyzing trace with hash -589856461, now seen corresponding path program 1 times [2025-01-10 01:38:07,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:38:07,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437740815] [2025-01-10 01:38:07,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:07,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:38:07,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:38:07,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:38:07,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:07,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:07,461 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:38:07,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:38:07,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437740815] [2025-01-10 01:38:07,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437740815] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:38:07,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788193810] [2025-01-10 01:38:07,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:07,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:38:07,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:38:07,464 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:38:07,469 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:38:07,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:38:07,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:38:07,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:07,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:07,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-01-10 01:38:07,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:38:07,598 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-01-10 01:38:07,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:38:07,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 1 [2025-01-10 01:38:08,586 INFO L349 Elim1Store]: treesize reduction 29, result has 49.1 percent of original size [2025-01-10 01:38:08,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 64 [2025-01-10 01:38:08,668 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:38:08,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:38:09,196 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:38:09,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788193810] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:38:09,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:38:09,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 12] total 31 [2025-01-10 01:38:09,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740995095] [2025-01-10 01:38:09,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:38:09,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-10 01:38:09,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:38:09,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-10 01:38:09,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=852, Unknown=0, NotChecked=0, Total=992 [2025-01-10 01:38:09,197 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 32 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 27 states have internal predecessors, (48), 8 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2025-01-10 01:38:09,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:38:09,803 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2025-01-10 01:38:09,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 01:38:09,803 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 27 states have internal predecessors, (48), 8 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Word has length 26 [2025-01-10 01:38:09,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:38:09,804 INFO L225 Difference]: With dead ends: 30 [2025-01-10 01:38:09,804 INFO L226 Difference]: Without dead ends: 29 [2025-01-10 01:38:09,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=344, Invalid=1378, Unknown=0, NotChecked=0, Total=1722 [2025-01-10 01:38:09,805 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 204 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:38:09,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 53 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:38:09,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-01-10 01:38:09,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-01-10 01:38:09,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:38:09,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2025-01-10 01:38:09,809 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 26 [2025-01-10 01:38:09,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:38:09,809 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2025-01-10 01:38:09,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 27 states have internal predecessors, (48), 8 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2025-01-10 01:38:09,809 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2025-01-10 01:38:09,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-10 01:38:09,809 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:38:09,809 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:38:09,816 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:38:10,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:38:10,014 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:38:10,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:38:10,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1380784573, now seen corresponding path program 1 times [2025-01-10 01:38:10,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:38:10,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777153107] [2025-01-10 01:38:10,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:10,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:38:10,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 01:38:10,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 01:38:10,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:10,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:10,383 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:38:10,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:38:10,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777153107] [2025-01-10 01:38:10,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777153107] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:38:10,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005123885] [2025-01-10 01:38:10,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:38:10,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:38:10,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:38:10,385 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:38:10,386 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:38:10,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 01:38:10,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 01:38:10,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:38:10,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:10,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-01-10 01:38:10,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:38:10,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2025-01-10 01:38:10,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 01:38:10,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2025-01-10 01:38:10,937 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 01:38:10,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:38:10,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 26 [2025-01-10 01:38:11,042 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:38:11,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:38:11,673 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:38:11,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005123885] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:38:11,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:38:11,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 14] total 34 [2025-01-10 01:38:11,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256573684] [2025-01-10 01:38:11,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:38:11,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-10 01:38:11,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:38:11,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-10 01:38:11,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1039, Unknown=0, NotChecked=0, Total=1190 [2025-01-10 01:38:11,675 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 35 states, 32 states have (on average 1.96875) internal successors, (63), 30 states have internal predecessors, (63), 8 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2025-01-10 01:38:12,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:38:12,282 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2025-01-10 01:38:12,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-10 01:38:12,283 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 1.96875) internal successors, (63), 30 states have internal predecessors, (63), 8 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Word has length 34 [2025-01-10 01:38:12,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:38:12,283 INFO L225 Difference]: With dead ends: 46 [2025-01-10 01:38:12,283 INFO L226 Difference]: Without dead ends: 45 [2025-01-10 01:38:12,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=456, Invalid=1896, Unknown=0, NotChecked=0, Total=2352 [2025-01-10 01:38:12,288 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 271 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:38:12,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 55 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:38:12,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-10 01:38:12,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-01-10 01:38:12,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:38:12,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2025-01-10 01:38:12,294 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 34 [2025-01-10 01:38:12,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:38:12,294 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2025-01-10 01:38:12,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 1.96875) internal successors, (63), 30 states have internal predecessors, (63), 8 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2025-01-10 01:38:12,295 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2025-01-10 01:38:12,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-10 01:38:12,295 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:38:12,295 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:38:12,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:38:12,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:38:12,496 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:38:12,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:38:12,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1415957713, now seen corresponding path program 2 times [2025-01-10 01:38:12,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:38:12,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482463650] [2025-01-10 01:38:12,497 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:38:12,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:38:12,506 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-01-10 01:38:12,521 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 01:38:12,521 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:38:12,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:12,970 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:38:12,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:38:12,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482463650] [2025-01-10 01:38:12,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482463650] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:38:12,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250174563] [2025-01-10 01:38:12,971 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:38:12,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:38:12,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:38:12,974 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:38:12,976 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:38:13,012 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-01-10 01:38:13,030 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 01:38:13,030 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:38:13,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:13,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-10 01:38:13,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:38:13,083 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-01-10 01:38:13,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:38:13,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 1 [2025-01-10 01:38:13,868 INFO L349 Elim1Store]: treesize reduction 29, result has 49.1 percent of original size [2025-01-10 01:38:13,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 64 [2025-01-10 01:38:13,943 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:38:13,943 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:38:14,425 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:38:14,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250174563] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:38:14,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:38:14,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 36 [2025-01-10 01:38:14,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373661622] [2025-01-10 01:38:14,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:38:14,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-10 01:38:14,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:38:14,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-10 01:38:14,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1167, Unknown=0, NotChecked=0, Total=1332 [2025-01-10 01:38:14,426 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 37 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 33 states have internal predecessors, (79), 6 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2025-01-10 01:38:15,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:38:15,178 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2025-01-10 01:38:15,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-10 01:38:15,178 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 33 states have internal predecessors, (79), 6 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) Word has length 50 [2025-01-10 01:38:15,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:38:15,179 INFO L225 Difference]: With dead ends: 62 [2025-01-10 01:38:15,179 INFO L226 Difference]: Without dead ends: 61 [2025-01-10 01:38:15,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 74 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=484, Invalid=2272, Unknown=0, NotChecked=0, Total=2756 [2025-01-10 01:38:15,180 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 154 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:38:15,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 78 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:38:15,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-01-10 01:38:15,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-01-10 01:38:15,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:38:15,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2025-01-10 01:38:15,189 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 50 [2025-01-10 01:38:15,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:38:15,189 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2025-01-10 01:38:15,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 33 states have internal predecessors, (79), 6 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2025-01-10 01:38:15,190 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2025-01-10 01:38:15,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-10 01:38:15,191 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:38:15,191 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:38:15,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 01:38:15,395 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,SelfDestructingSolverStorable6 [2025-01-10 01:38:15,395 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:38:15,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:38:15,396 INFO L85 PathProgramCache]: Analyzing trace with hash 972937189, now seen corresponding path program 3 times [2025-01-10 01:38:15,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:38:15,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905784042] [2025-01-10 01:38:15,396 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:38:15,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:38:15,405 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 66 statements into 11 equivalence classes. [2025-01-10 01:38:15,418 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 34 of 66 statements. [2025-01-10 01:38:15,418 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-10 01:38:15,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:15,757 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2025-01-10 01:38:15,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:38:15,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905784042] [2025-01-10 01:38:15,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905784042] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:38:15,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568819905] [2025-01-10 01:38:15,758 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:38:15,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:38:15,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:38:15,763 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:38:15,764 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:38:15,814 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 66 statements into 11 equivalence classes. [2025-01-10 01:38:15,832 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 34 of 66 statements. [2025-01-10 01:38:15,833 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-10 01:38:15,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:38:15,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-10 01:38:15,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:38:15,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 51 [2025-01-10 01:38:15,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:38:15,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:38:15,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 39 [2025-01-10 01:38:15,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2025-01-10 01:38:17,237 INFO L349 Elim1Store]: treesize reduction 29, result has 49.1 percent of original size [2025-01-10 01:38:17,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 58 [2025-01-10 01:38:17,285 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2025-01-10 01:38:17,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:38:17,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:38:17,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 66 [2025-01-10 01:38:17,666 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:38:17,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 74 [2025-01-10 01:38:17,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 127 [2025-01-10 01:38:17,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-01-10 01:38:17,699 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2025-01-10 01:38:17,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568819905] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:38:17,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:38:17,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 29 [2025-01-10 01:38:17,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648856633] [2025-01-10 01:38:17,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:38:17,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-10 01:38:17,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:38:17,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-10 01:38:17,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2025-01-10 01:38:17,700 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand has 30 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 26 states have internal predecessors, (51), 7 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-01-10 01:38:18,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:38:18,121 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2025-01-10 01:38:18,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:38:18,121 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 26 states have internal predecessors, (51), 7 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 66 [2025-01-10 01:38:18,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:38:18,122 INFO L225 Difference]: With dead ends: 61 [2025-01-10 01:38:18,122 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 01:38:18,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 111 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=222, Invalid=1110, Unknown=0, NotChecked=0, Total=1332 [2025-01-10 01:38:18,122 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 16 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:38:18,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 92 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:38:18,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 01:38:18,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 01:38:18,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:38:18,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 01:38:18,123 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2025-01-10 01:38:18,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:38:18,123 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 01:38:18,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 26 states have internal predecessors, (51), 7 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-01-10 01:38:18,123 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 01:38:18,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 01:38:18,126 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-01-10 01:38:18,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-01-10 01:38:18,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-01-10 01:38:18,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-01-10 01:38:18,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 01:38:18,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:38:18,330 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2025-01-10 01:38:18,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 01:38:18,782 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:38:18,791 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-10 01:38:18,792 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-10 01:38:18,792 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~pd2~0!base,]]] [2025-01-10 01:38:18,792 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~short15 [2025-01-10 01:38:18,792 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-10 01:38:18,792 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-10 01:38:18,792 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[5]]] [2025-01-10 01:38:18,792 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d2~0!offset [2025-01-10 01:38:18,792 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d1~0!base [2025-01-10 01:38:18,793 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d2~0!base [2025-01-10 01:38:18,793 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pa~0!base [2025-01-10 01:38:18,793 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-10 01:38:18,793 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-10 01:38:18,793 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[4]]] [2025-01-10 01:38:18,793 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pa~0!offset [2025-01-10 01:38:18,793 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pa~0!base [2025-01-10 01:38:18,793 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-10 01:38:18,793 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-10 01:38:18,793 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~pa~0!base,]]] [2025-01-10 01:38:18,793 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pa~0!offset [2025-01-10 01:38:18,793 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pa~0!base [2025-01-10 01:38:18,793 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d1~0!offset [2025-01-10 01:38:18,793 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pd2~0!offset [2025-01-10 01:38:18,793 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pd2~0!base [2025-01-10 01:38:18,793 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pd2~0!offset [2025-01-10 01:38:18,793 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pd2~0!base [2025-01-10 01:38:18,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:38:18 BoogieIcfgContainer [2025-01-10 01:38:18,795 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:38:18,795 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:38:18,795 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:38:18,795 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:38:18,796 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:38:04" (3/4) ... [2025-01-10 01:38:18,797 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:38:18,801 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure get_dummy [2025-01-10 01:38:18,804 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-10 01:38:18,804 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-10 01:38:18,804 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 01:38:18,804 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 01:38:18,867 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:38:18,868 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:38:18,868 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:38:18,869 INFO L158 Benchmark]: Toolchain (without parser) took 15118.84ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 113.8MB in the beginning and 261.4MB in the end (delta: -147.6MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2025-01-10 01:38:18,869 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:38:18,869 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.62ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 102.6MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:38:18,869 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.54ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 101.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:38:18,869 INFO L158 Benchmark]: Boogie Preprocessor took 20.81ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 99.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:38:18,870 INFO L158 Benchmark]: RCFGBuilder took 209.91ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 86.4MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 01:38:18,870 INFO L158 Benchmark]: TraceAbstraction took 14602.45ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 85.9MB in the beginning and 266.0MB in the end (delta: -180.1MB). Peak memory consumption was 163.0MB. Max. memory is 16.1GB. [2025-01-10 01:38:18,870 INFO L158 Benchmark]: Witness Printer took 72.56ms. Allocated memory is still 327.2MB. Free memory was 266.0MB in the beginning and 261.4MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:38:18,871 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 180.62ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 102.6MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.54ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 101.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.81ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 99.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 209.91ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 86.4MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14602.45ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 85.9MB in the beginning and 266.0MB in the end (delta: -180.1MB). Peak memory consumption was 163.0MB. Max. memory is 16.1GB. * Witness Printer took 72.56ms. Allocated memory is still 327.2MB. Free memory was 266.0MB in the beginning and 261.4MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~pd2~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~short15 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[5]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d2~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d1~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d2~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pa~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[4]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pa~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pa~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~pa~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pa~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pa~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d1~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pd2~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pd2~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pd2~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pd2~0!base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 14.1s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 701 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 698 mSDsluCounter, 507 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 385 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1045 IncrementalHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 122 mSDtfsCounter, 1045 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 516 GetRequests, 298 SyntacticMatches, 16 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1841 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=7, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 463 NumberOfCodeBlocks, 399 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 643 ConstructedInterpolants, 77 QuantifiedInterpolants, 9276 SizeOfPredicates, 61 NumberOfNonLiveVariables, 758 ConjunctsInSsa, 190 ConjunctsInUnsatCore, 18 InterpolantComputations, 3 PerfectInterpolantSequences, 670/1110 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: (0 <= (i + 2147483648)) RESULT: Ultimate proved your program to be correct! [2025-01-10 01:38:18,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE