./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-acceleration/array_3-2.i --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/loop-acceleration/array_3-2.i -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 42bdab47928922c9249a376933fe7b7a33d855d426cfe04eb271066ef5c44d0a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:43:13,844 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:43:13,900 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:43:13,906 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:43:13,906 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:43:13,924 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:43:13,925 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:43:13,925 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:43:13,925 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:43:13,925 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:43:13,925 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:43:13,925 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:43:13,925 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:43:13,925 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:43:13,926 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:43:13,926 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:43:13,926 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:43:13,926 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:43:13,926 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:43:13,926 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:43:13,926 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:43:13,926 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:43:13,926 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:43:13,926 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:43:13,927 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:43:13,927 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:43:13,927 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:43:13,927 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:43:13,927 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:43:13,927 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:43:13,927 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:43:13,927 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:43:13,927 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:43:13,927 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:43:13,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:43:13,928 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:43:13,928 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:43:13,928 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:43:13,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:43:13,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:43:13,928 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:43:13,928 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:43:13,928 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:43:13,928 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:43:13,928 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:43:13,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:43:13,928 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:43:13,928 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:43:13,929 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:43:13,929 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:43:13,929 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 -> 42bdab47928922c9249a376933fe7b7a33d855d426cfe04eb271066ef5c44d0a [2025-01-10 01:43:14,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:43:14,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:43:14,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:43:14,186 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:43:14,186 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:43:14,187 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-acceleration/array_3-2.i [2025-01-10 01:43:15,375 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ed1c226b/36164bfd4a5b4b639aff67ab16bf656c/FLAGc1b74d597 [2025-01-10 01:43:15,630 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:43:15,630 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-acceleration/array_3-2.i [2025-01-10 01:43:15,637 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ed1c226b/36164bfd4a5b4b639aff67ab16bf656c/FLAGc1b74d597 [2025-01-10 01:43:15,651 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ed1c226b/36164bfd4a5b4b639aff67ab16bf656c [2025-01-10 01:43:15,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:43:15,655 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:43:15,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:43:15,656 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:43:15,660 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:43:15,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:43:15" (1/1) ... [2025-01-10 01:43:15,662 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33635bd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:15, skipping insertion in model container [2025-01-10 01:43:15,662 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:43:15" (1/1) ... [2025-01-10 01:43:15,673 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:43:15,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:43:15,796 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:43:15,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:43:15,821 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:43:15,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:15 WrapperNode [2025-01-10 01:43:15,823 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:43:15,824 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:43:15,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:43:15,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:43:15,829 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:43:15" (1/1) ... [2025-01-10 01:43:15,833 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:43:15" (1/1) ... [2025-01-10 01:43:15,845 INFO L138 Inliner]: procedures = 16, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 49 [2025-01-10 01:43:15,846 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:43:15,847 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:43:15,847 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:43:15,847 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:43:15,852 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:15" (1/1) ... [2025-01-10 01:43:15,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:15" (1/1) ... [2025-01-10 01:43:15,854 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:15" (1/1) ... [2025-01-10 01:43:15,865 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-10 01:43:15,865 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:15" (1/1) ... [2025-01-10 01:43:15,866 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:15" (1/1) ... [2025-01-10 01:43:15,869 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:15" (1/1) ... [2025-01-10 01:43:15,871 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:15" (1/1) ... [2025-01-10 01:43:15,873 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:15" (1/1) ... [2025-01-10 01:43:15,877 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:15" (1/1) ... [2025-01-10 01:43:15,877 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:15" (1/1) ... [2025-01-10 01:43:15,878 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:43:15,880 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:43:15,880 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:43:15,880 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:43:15,882 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:15" (1/1) ... [2025-01-10 01:43:15,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:43:15,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:43:15,906 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:43:15,909 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:43:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:43:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:43:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:43:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 01:43:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:43:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:43:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:43:15,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:43:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:43:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:43:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 01:43:15,983 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:43:15,985 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:43:16,105 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-01-10 01:43:16,105 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:43:16,114 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:43:16,114 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 01:43:16,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:43:16 BoogieIcfgContainer [2025-01-10 01:43:16,114 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:43:16,116 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:43:16,116 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:43:16,119 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:43:16,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:43:15" (1/3) ... [2025-01-10 01:43:16,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d108fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:43:16, skipping insertion in model container [2025-01-10 01:43:16,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:43:15" (2/3) ... [2025-01-10 01:43:16,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d108fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:43:16, skipping insertion in model container [2025-01-10 01:43:16,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:43:16" (3/3) ... [2025-01-10 01:43:16,121 INFO L128 eAbstractionObserver]: Analyzing ICFG array_3-2.i [2025-01-10 01:43:16,132 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:43:16,134 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array_3-2.i that has 1 procedures, 24 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-01-10 01:43:16,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:43:16,182 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;@2c5af7c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:43:16,182 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-10 01:43:16,184 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 23 states have internal predecessors, (29), 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:43:16,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 01:43:16,187 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:16,188 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 01:43:16,189 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:43:16,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:16,194 INFO L85 PathProgramCache]: Analyzing trace with hash 925636, now seen corresponding path program 1 times [2025-01-10 01:43:16,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:16,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104521328] [2025-01-10 01:43:16,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:16,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:16,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:43:16,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:43:16,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:16,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:16,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:43:16,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:16,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104521328] [2025-01-10 01:43:16,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104521328] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:16,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:16,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:43:16,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782998433] [2025-01-10 01:43:16,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:16,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:43:16,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:16,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:43:16,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:43:16,402 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 23 states have internal predecessors, (29), 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) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:43:16,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:16,467 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2025-01-10 01:43:16,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:43:16,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-10 01:43:16,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:16,473 INFO L225 Difference]: With dead ends: 50 [2025-01-10 01:43:16,475 INFO L226 Difference]: Without dead ends: 22 [2025-01-10 01:43:16,478 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:43:16,480 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:16,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 46 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:43:16,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-01-10 01:43:16,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2025-01-10 01:43:16,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 17 states have internal predecessors, (20), 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:43:16,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2025-01-10 01:43:16,508 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 4 [2025-01-10 01:43:16,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:16,509 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2025-01-10 01:43:16,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:43:16,509 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2025-01-10 01:43:16,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:43:16,509 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:16,509 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 01:43:16,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:43:16,511 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:43:16,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:16,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1805857894, now seen corresponding path program 1 times [2025-01-10 01:43:16,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:16,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540413502] [2025-01-10 01:43:16,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:16,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:16,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:43:16,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:43:16,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:16,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:16,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:43:16,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:16,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540413502] [2025-01-10 01:43:16,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540413502] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:43:16,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760744222] [2025-01-10 01:43:16,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:16,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:43:16,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:43:16,663 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:43:16,665 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:43:16,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:43:16,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:43:16,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:16,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:16,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:43:16,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:43:16,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:43:16,766 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:43:16,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760744222] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:16,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:43:16,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 01:43:16,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911558280] [2025-01-10 01:43:16,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:16,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:43:16,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:16,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:43:16,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:43:16,768 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:43:16,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:16,824 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2025-01-10 01:43:16,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:43:16,824 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-10 01:43:16,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:16,825 INFO L225 Difference]: With dead ends: 22 [2025-01-10 01:43:16,825 INFO L226 Difference]: Without dead ends: 21 [2025-01-10 01:43:16,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:43:16,825 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 5 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:16,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 34 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:16,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-01-10 01:43:16,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2025-01-10 01:43:16,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:43:16,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2025-01-10 01:43:16,831 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 7 [2025-01-10 01:43:16,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:16,832 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2025-01-10 01:43:16,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:43:16,832 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2025-01-10 01:43:16,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:43:16,833 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:16,833 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-01-10 01:43:16,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 01:43:17,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:43:17,038 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:43:17,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:17,041 INFO L85 PathProgramCache]: Analyzing trace with hash 147019906, now seen corresponding path program 1 times [2025-01-10 01:43:17,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:17,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398906455] [2025-01-10 01:43:17,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:17,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:17,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:43:17,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:43:17,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:17,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:17,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:43:17,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:17,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398906455] [2025-01-10 01:43:17,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398906455] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:17,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:17,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:43:17,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676996685] [2025-01-10 01:43:17,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:17,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:43:17,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:17,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:43:17,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:43:17,117 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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:43:17,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:17,125 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2025-01-10 01:43:17,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:43:17,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-10 01:43:17,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:17,127 INFO L225 Difference]: With dead ends: 17 [2025-01-10 01:43:17,127 INFO L226 Difference]: Without dead ends: 16 [2025-01-10 01:43:17,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:43:17,128 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:17,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:17,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-01-10 01:43:17,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2025-01-10 01:43:17,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 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:43:17,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2025-01-10 01:43:17,130 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 8 [2025-01-10 01:43:17,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:17,130 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2025-01-10 01:43:17,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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:43:17,130 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2025-01-10 01:43:17,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 01:43:17,133 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:17,133 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:43:17,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:43:17,133 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:43:17,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:17,135 INFO L85 PathProgramCache]: Analyzing trace with hash -817136336, now seen corresponding path program 1 times [2025-01-10 01:43:17,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:17,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914430191] [2025-01-10 01:43:17,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:17,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:17,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:43:17,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:43:17,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:17,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:17,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:43:17,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:17,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914430191] [2025-01-10 01:43:17,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914430191] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:43:17,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398405991] [2025-01-10 01:43:17,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:17,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:43:17,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:43:17,251 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:43:17,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:43:17,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:43:17,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:43:17,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:17,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:17,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:43:17,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:43:17,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:43:17,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:43:17,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:43:17,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398405991] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:43:17,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:43:17,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-10 01:43:17,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884493103] [2025-01-10 01:43:17,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:43:17,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:43:17,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:17,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:43:17,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:43:17,367 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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:43:17,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:17,412 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2025-01-10 01:43:17,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:43:17,412 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-10 01:43:17,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:17,413 INFO L225 Difference]: With dead ends: 32 [2025-01-10 01:43:17,413 INFO L226 Difference]: Without dead ends: 24 [2025-01-10 01:43:17,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:43:17,414 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:17,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 45 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:17,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-01-10 01:43:17,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2025-01-10 01:43:17,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 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:43:17,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2025-01-10 01:43:17,416 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 11 [2025-01-10 01:43:17,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:17,417 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2025-01-10 01:43:17,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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:43:17,417 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2025-01-10 01:43:17,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-10 01:43:17,417 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:17,417 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:43:17,423 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:43:17,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:43:17,618 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:43:17,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:17,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1109098608, now seen corresponding path program 2 times [2025-01-10 01:43:17,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:17,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935228601] [2025-01-10 01:43:17,619 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:43:17,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:17,626 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-01-10 01:43:17,629 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 17 statements. [2025-01-10 01:43:17,629 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:43:17,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:17,655 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:43:17,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:17,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935228601] [2025-01-10 01:43:17,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935228601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:17,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:17,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:43:17,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544761445] [2025-01-10 01:43:17,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:17,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:43:17,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:17,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:43:17,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:43:17,657 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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:43:17,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:17,676 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2025-01-10 01:43:17,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:43:17,677 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-01-10 01:43:17,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:17,677 INFO L225 Difference]: With dead ends: 27 [2025-01-10 01:43:17,677 INFO L226 Difference]: Without dead ends: 26 [2025-01-10 01:43:17,677 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:43:17,678 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:17,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 19 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:17,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-01-10 01:43:17,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2025-01-10 01:43:17,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:43:17,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-01-10 01:43:17,681 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 17 [2025-01-10 01:43:17,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:17,681 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-01-10 01:43:17,681 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), 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:43:17,681 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2025-01-10 01:43:17,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 01:43:17,682 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:17,682 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:43:17,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:43:17,682 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:43:17,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:17,683 INFO L85 PathProgramCache]: Analyzing trace with hash 22318543, now seen corresponding path program 1 times [2025-01-10 01:43:17,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:17,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223860417] [2025-01-10 01:43:17,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:17,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:17,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:43:17,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:43:17,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:17,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:17,731 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:43:17,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:17,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223860417] [2025-01-10 01:43:17,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223860417] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:17,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:17,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:43:17,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145187706] [2025-01-10 01:43:17,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:17,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:43:17,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:17,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:43:17,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:43:17,732 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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:43:17,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:17,750 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2025-01-10 01:43:17,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:43:17,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-01-10 01:43:17,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:17,751 INFO L225 Difference]: With dead ends: 27 [2025-01-10 01:43:17,751 INFO L226 Difference]: Without dead ends: 26 [2025-01-10 01:43:17,752 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:43:17,752 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:17,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 21 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:17,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-01-10 01:43:17,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-01-10 01:43:17,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 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:43:17,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2025-01-10 01:43:17,755 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2025-01-10 01:43:17,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:17,755 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2025-01-10 01:43:17,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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:43:17,755 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2025-01-10 01:43:17,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 01:43:17,755 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:17,755 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:43:17,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:43:17,755 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:43:17,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:17,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1302982457, now seen corresponding path program 1 times [2025-01-10 01:43:17,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:17,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408076465] [2025-01-10 01:43:17,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:17,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:17,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:43:17,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:43:17,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:17,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:17,854 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:43:17,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:17,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408076465] [2025-01-10 01:43:17,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408076465] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:43:17,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056117723] [2025-01-10 01:43:17,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:17,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:43:17,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:43:17,859 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:43:17,861 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:43:17,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:43:17,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:43:17,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:17,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:17,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:43:17,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:43:17,955 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:43:17,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:43:18,053 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:43:18,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056117723] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:43:18,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:43:18,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-01-10 01:43:18,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976558535] [2025-01-10 01:43:18,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:43:18,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 01:43:18,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:18,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 01:43:18,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:43:18,054 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 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:43:18,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:18,113 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2025-01-10 01:43:18,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 01:43:18,114 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-01-10 01:43:18,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:18,114 INFO L225 Difference]: With dead ends: 52 [2025-01-10 01:43:18,114 INFO L226 Difference]: Without dead ends: 38 [2025-01-10 01:43:18,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:43:18,118 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 4 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:18,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 55 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:43:18,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-01-10 01:43:18,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-01-10 01:43:18,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 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:43:18,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2025-01-10 01:43:18,124 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 23 [2025-01-10 01:43:18,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:18,124 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2025-01-10 01:43:18,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 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:43:18,124 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2025-01-10 01:43:18,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-10 01:43:18,125 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:18,125 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:43:18,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:43:18,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:43:18,326 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:43:18,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:18,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1602807623, now seen corresponding path program 2 times [2025-01-10 01:43:18,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:18,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660179244] [2025-01-10 01:43:18,326 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:43:18,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:18,341 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-01-10 01:43:18,357 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 01:43:18,360 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:43:18,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:18,492 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-10 01:43:18,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:18,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660179244] [2025-01-10 01:43:18,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660179244] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:43:18,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608210463] [2025-01-10 01:43:18,492 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:43:18,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:43:18,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:43:18,495 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:43:18,497 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:43:18,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-01-10 01:43:18,551 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 01:43:18,551 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:43:18,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:18,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:43:18,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:43:18,845 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:43:18,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:43:19,157 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:43:19,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608210463] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:43:19,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:43:19,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 17, 17] total 36 [2025-01-10 01:43:19,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674064431] [2025-01-10 01:43:19,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:43:19,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-01-10 01:43:19,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:19,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-01-10 01:43:19,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=964, Unknown=0, NotChecked=0, Total=1260 [2025-01-10 01:43:19,162 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 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:43:19,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:19,277 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2025-01-10 01:43:19,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-01-10 01:43:19,278 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-01-10 01:43:19,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:19,278 INFO L225 Difference]: With dead ends: 79 [2025-01-10 01:43:19,278 INFO L226 Difference]: Without dead ends: 65 [2025-01-10 01:43:19,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2025-01-10 01:43:19,279 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 22 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:19,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 54 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:43:19,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-01-10 01:43:19,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2025-01-10 01:43:19,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 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:43:19,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2025-01-10 01:43:19,284 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 35 [2025-01-10 01:43:19,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:19,284 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2025-01-10 01:43:19,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 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:43:19,285 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2025-01-10 01:43:19,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-10 01:43:19,285 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:19,285 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 01:43:19,295 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:43:19,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-10 01:43:19,490 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:43:19,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:19,491 INFO L85 PathProgramCache]: Analyzing trace with hash -2109393704, now seen corresponding path program 1 times [2025-01-10 01:43:19,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:19,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700513071] [2025-01-10 01:43:19,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:19,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:19,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-10 01:43:19,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-10 01:43:19,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:19,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:19,621 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2025-01-10 01:43:19,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:19,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700513071] [2025-01-10 01:43:19,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700513071] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:19,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:19,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:43:19,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815907134] [2025-01-10 01:43:19,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:19,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:43:19,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:19,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:43:19,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:43:19,623 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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:43:19,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:19,654 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2025-01-10 01:43:19,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:43:19,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-01-10 01:43:19,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:19,655 INFO L225 Difference]: With dead ends: 62 [2025-01-10 01:43:19,655 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 01:43:19,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:43:19,656 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 4 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:19,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 15 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:19,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 01:43:19,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 01:43:19,656 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:43:19,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 01:43:19,656 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2025-01-10 01:43:19,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:19,656 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 01:43:19,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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:43:19,656 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 01:43:19,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 01:43:19,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-01-10 01:43:19,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-01-10 01:43:19,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-01-10 01:43:19,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-01-10 01:43:19,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:43:19,661 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2025-01-10 01:43:19,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 01:43:19,686 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:43:19,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:43:19 BoogieIcfgContainer [2025-01-10 01:43:19,694 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:43:19,695 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:43:19,695 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:43:19,695 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:43:19,696 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:43:16" (3/4) ... [2025-01-10 01:43:19,697 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:43:19,703 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-01-10 01:43:19,703 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-10 01:43:19,704 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 01:43:19,704 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 01:43:19,754 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:43:19,754 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:43:19,754 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:43:19,755 INFO L158 Benchmark]: Toolchain (without parser) took 4100.22ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 77.4MB in the end (delta: 27.9MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2025-01-10 01:43:19,755 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:43:19,755 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.98ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 94.4MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:43:19,755 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.00ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 93.5MB in the end (delta: 889.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:43:19,755 INFO L158 Benchmark]: Boogie Preprocessor took 33.05ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 92.2MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:43:19,756 INFO L158 Benchmark]: RCFGBuilder took 233.98ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 81.2MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:43:19,756 INFO L158 Benchmark]: TraceAbstraction took 3577.95ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 83.1MB in the end (delta: -2.0MB). Peak memory consumption was 433.2kB. Max. memory is 16.1GB. [2025-01-10 01:43:19,756 INFO L158 Benchmark]: Witness Printer took 59.28ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 77.4MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:43:19,757 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.33ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 167.98ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 94.4MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.00ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 93.5MB in the end (delta: 889.4kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.05ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 92.2MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 233.98ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 81.2MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3577.95ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 83.1MB in the end (delta: -2.0MB). Peak memory consumption was 433.2kB. Max. memory is 16.1GB. * Witness Printer took 59.28ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 77.4MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: 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 1 procedures, 24 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 9, TraceHistogramMax: 15, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 52 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 52 mSDsluCounter, 313 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 225 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 433 IncrementalHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 88 mSDtfsCounter, 433 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 178 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=8, InterpolantAutomatonStates: 83, 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, 9 MinimizatonAttempts, 19 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 259 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 312 ConstructedInterpolants, 0 QuantifiedInterpolants, 569 SizeOfPredicates, 0 NumberOfNonLiveVariables, 350 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 460/646 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: 26]: Loop Invariant Derived loop invariant: ((0 < i) || (i == 0)) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((0 < i) || (i == 0)) RESULT: Ultimate proved your program to be correct! [2025-01-10 01:43:19,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE