./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-memory-alloca/genady-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-alloca/genady-alloca.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 3cf25f06134410cf3fe2cb13bebb45512b92052388b257a9b0f3e089d05f1ab2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:40:41,758 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:40:41,795 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 01:40:41,799 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:40:41,799 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:40:41,813 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:40:41,814 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:40:41,814 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:40:41,814 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:40:41,814 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:40:41,814 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:40:41,814 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:40:41,814 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:40:41,814 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:40:41,814 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:40:41,815 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:40:41,815 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:40:41,815 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:40:41,815 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:40:41,815 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:40:41,815 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:40:41,815 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:40:41,815 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:40:41,815 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:40:41,815 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:40:41,815 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:40:41,815 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:40:41,815 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:40:41,815 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:40:41,815 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:40:41,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:40:41,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:40:41,815 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:40:41,815 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:40:41,816 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:40:41,816 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:40:41,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:40:41,816 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:40:41,816 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:40:41,816 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:40:41,816 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:40:41,816 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:40:41,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:40:41,816 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:40:41,816 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:40:41,816 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:40:41,816 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:40:41,816 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3cf25f06134410cf3fe2cb13bebb45512b92052388b257a9b0f3e089d05f1ab2 [2025-01-10 01:40:41,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:40:41,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:40:41,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:40:41,995 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:40:41,995 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:40:41,996 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/genady-alloca.i [2025-01-10 01:40:43,094 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e9e883b7e/40c85a9262bc48c587dfb196095cadf8/FLAG1d7fc224e [2025-01-10 01:40:43,387 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:40:43,387 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/genady-alloca.i [2025-01-10 01:40:43,403 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e9e883b7e/40c85a9262bc48c587dfb196095cadf8/FLAG1d7fc224e [2025-01-10 01:40:43,661 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e9e883b7e/40c85a9262bc48c587dfb196095cadf8 [2025-01-10 01:40:43,662 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:40:43,663 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:40:43,665 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:40:43,665 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:40:43,667 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:40:43,668 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:40:43" (1/1) ... [2025-01-10 01:40:43,669 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3580666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:40:43, skipping insertion in model container [2025-01-10 01:40:43,669 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:40:43" (1/1) ... [2025-01-10 01:40:43,695 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:40:43,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:40:43,897 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:40:43,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:40:43,955 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:40:43,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:40:43 WrapperNode [2025-01-10 01:40:43,958 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:40:43,959 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:40:43,959 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:40:43,959 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:40:43,963 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:40:43" (1/1) ... [2025-01-10 01:40:43,970 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:40:43" (1/1) ... [2025-01-10 01:40:43,981 INFO L138 Inliner]: procedures = 109, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 39 [2025-01-10 01:40:43,982 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:40:43,983 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:40:43,983 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:40:43,984 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:40:43,989 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:40:43" (1/1) ... [2025-01-10 01:40:43,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:40:43" (1/1) ... [2025-01-10 01:40:43,991 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:40:43" (1/1) ... [2025-01-10 01:40:43,999 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [4, 4]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2025-01-10 01:40:43,999 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:40:43" (1/1) ... [2025-01-10 01:40:44,000 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:40:43" (1/1) ... [2025-01-10 01:40:44,006 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:40:43" (1/1) ... [2025-01-10 01:40:44,006 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:40:43" (1/1) ... [2025-01-10 01:40:44,008 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:40:43" (1/1) ... [2025-01-10 01:40:44,010 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:40:43" (1/1) ... [2025-01-10 01:40:44,014 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:40:43" (1/1) ... [2025-01-10 01:40:44,015 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:40:44,016 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:40:44,016 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:40:44,016 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:40:44,016 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:40:43" (1/1) ... [2025-01-10 01:40:44,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:40:44,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:40:44,046 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:40:44,051 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:40:44,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:40:44,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:40:44,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:40:44,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:40:44,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 01:40:44,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 01:40:44,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:40:44,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:40:44,145 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:40:44,146 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:40:44,204 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-10 01:40:44,204 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:40:44,210 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:40:44,211 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 01:40:44,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:40:44 BoogieIcfgContainer [2025-01-10 01:40:44,211 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:40:44,213 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:40:44,213 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:40:44,217 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:40:44,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:40:43" (1/3) ... [2025-01-10 01:40:44,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@90bad23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:40:44, skipping insertion in model container [2025-01-10 01:40:44,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:40:43" (2/3) ... [2025-01-10 01:40:44,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@90bad23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:40:44, skipping insertion in model container [2025-01-10 01:40:44,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:40:44" (3/3) ... [2025-01-10 01:40:44,219 INFO L128 eAbstractionObserver]: Analyzing ICFG genady-alloca.i [2025-01-10 01:40:44,230 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:40:44,231 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG genady-alloca.i that has 1 procedures, 21 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2025-01-10 01:40:44,261 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:40:44,268 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;@e7f299c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:40:44,268 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 01:40:44,271 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 20 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:40:44,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 01:40:44,274 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:40:44,274 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 01:40:44,274 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:40:44,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:40:44,278 INFO L85 PathProgramCache]: Analyzing trace with hash 925636, now seen corresponding path program 1 times [2025-01-10 01:40:44,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:40:44,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209578898] [2025-01-10 01:40:44,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:40:44,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:40:44,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:40:44,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:40:44,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:40:44,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:40:44,517 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:40:44,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:40:44,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209578898] [2025-01-10 01:40:44,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209578898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:40:44,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:40:44,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:40:44,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796318222] [2025-01-10 01:40:44,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:40:44,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:40:44,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:40:44,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:40:44,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:40:44,545 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 20 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) 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:40:44,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:40:44,616 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2025-01-10 01:40:44,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:40:44,618 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:40:44,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:40:44,622 INFO L225 Difference]: With dead ends: 36 [2025-01-10 01:40:44,623 INFO L226 Difference]: Without dead ends: 26 [2025-01-10 01:40:44,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:40:44,626 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:40:44,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 40 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:40:44,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-01-10 01:40:44,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2025-01-10 01:40:44,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 19 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:40:44,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2025-01-10 01:40:44,649 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 4 [2025-01-10 01:40:44,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:40:44,649 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2025-01-10 01:40:44,649 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:40:44,650 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2025-01-10 01:40:44,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:40:44,650 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:40:44,650 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:40:44,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:40:44,651 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:40:44,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:40:44,653 INFO L85 PathProgramCache]: Analyzing trace with hash 147026921, now seen corresponding path program 1 times [2025-01-10 01:40:44,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:40:44,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953896944] [2025-01-10 01:40:44,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:40:44,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:40:44,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:40:44,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:40:44,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:40:44,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:40:44,775 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:40:44,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:40:44,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953896944] [2025-01-10 01:40:44,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953896944] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:40:44,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:40:44,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:40:44,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993052817] [2025-01-10 01:40:44,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:40:44,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:40:44,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:40:44,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:40:44,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:40:44,780 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:40:44,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:40:44,820 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2025-01-10 01:40:44,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:40:44,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:40:44,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:40:44,821 INFO L225 Difference]: With dead ends: 20 [2025-01-10 01:40:44,821 INFO L226 Difference]: Without dead ends: 19 [2025-01-10 01:40:44,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:40:44,823 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:40:44,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 22 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:40:44,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-01-10 01:40:44,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-01-10 01:40:44,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 18 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:40:44,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2025-01-10 01:40:44,827 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 8 [2025-01-10 01:40:44,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:40:44,828 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2025-01-10 01:40:44,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:40:44,828 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2025-01-10 01:40:44,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 01:40:44,828 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:40:44,828 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:40:44,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:40:44,828 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:40:44,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:40:44,829 INFO L85 PathProgramCache]: Analyzing trace with hash 262867306, now seen corresponding path program 1 times [2025-01-10 01:40:44,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:40:44,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726737724] [2025-01-10 01:40:44,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:40:44,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:40:44,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:40:44,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:40:44,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:40:44,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:40:44,922 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:40:44,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:40:44,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726737724] [2025-01-10 01:40:44,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726737724] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:40:44,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:40:44,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:40:44,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174372944] [2025-01-10 01:40:44,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:40:44,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:40:44,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:40:44,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:40:44,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:40:44,923 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:40:44,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:40:44,953 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2025-01-10 01:40:44,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:40:44,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-10 01:40:44,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:40:44,953 INFO L225 Difference]: With dead ends: 24 [2025-01-10 01:40:44,954 INFO L226 Difference]: Without dead ends: 23 [2025-01-10 01:40:44,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:40:44,954 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:40:44,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 34 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:40:44,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-01-10 01:40:44,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-01-10 01:40:44,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 22 states have internal predecessors, (23), 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:40:44,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2025-01-10 01:40:44,959 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 9 [2025-01-10 01:40:44,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:40:44,960 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2025-01-10 01:40:44,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:40:44,960 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2025-01-10 01:40:44,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 01:40:44,960 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:40:44,960 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:40:44,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:40:44,960 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:40:44,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:40:44,961 INFO L85 PathProgramCache]: Analyzing trace with hash -441048053, now seen corresponding path program 1 times [2025-01-10 01:40:44,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:40:44,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637757101] [2025-01-10 01:40:44,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:40:44,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:40:44,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:40:44,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:40:44,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:40:44,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:40:45,048 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:40:45,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:40:45,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637757101] [2025-01-10 01:40:45,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637757101] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:40:45,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:40:45,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:40:45,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46119852] [2025-01-10 01:40:45,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:40:45,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:40:45,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:40:45,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:40:45,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:40:45,051 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:40:45,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:40:45,081 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2025-01-10 01:40:45,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:40:45,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-10 01:40:45,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:40:45,082 INFO L225 Difference]: With dead ends: 27 [2025-01-10 01:40:45,083 INFO L226 Difference]: Without dead ends: 25 [2025-01-10 01:40:45,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:40:45,084 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:40:45,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 33 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:40:45,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-01-10 01:40:45,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-01-10 01:40:45,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 24 states have internal predecessors, (25), 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:40:45,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2025-01-10 01:40:45,089 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 10 [2025-01-10 01:40:45,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:40:45,089 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2025-01-10 01:40:45,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:40:45,089 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2025-01-10 01:40:45,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 01:40:45,090 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:40:45,090 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:40:45,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:40:45,091 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:40:45,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:40:45,091 INFO L85 PathProgramCache]: Analyzing trace with hash -957534450, now seen corresponding path program 1 times [2025-01-10 01:40:45,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:40:45,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155754893] [2025-01-10 01:40:45,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:40:45,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:40:45,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:40:45,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:40:45,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:40:45,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:40:45,296 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:40:45,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:40:45,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155754893] [2025-01-10 01:40:45,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155754893] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:40:45,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576985901] [2025-01-10 01:40:45,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:40:45,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:40:45,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:40:45,302 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:40:45,303 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:40:45,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:40:45,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:40:45,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:40:45,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:40:45,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 01:40:45,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:40:45,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 01:40:45,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 01:40:45,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 01:40:45,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-01-10 01:40:45,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 01:40:45,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 01:40:45,601 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:40:45,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:40:45,678 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:40:45,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576985901] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:40:45,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:40:45,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-01-10 01:40:45,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93024807] [2025-01-10 01:40:45,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:40:45,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:40:45,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:40:45,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:40:45,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:40:45,679 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 16 states have internal predecessors, (32), 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:40:45,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:40:45,827 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2025-01-10 01:40:45,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 01:40:45,828 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 16 states have internal predecessors, (32), 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 13 [2025-01-10 01:40:45,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:40:45,828 INFO L225 Difference]: With dead ends: 48 [2025-01-10 01:40:45,828 INFO L226 Difference]: Without dead ends: 47 [2025-01-10 01:40:45,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2025-01-10 01:40:45,829 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 37 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:40:45,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 25 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:40:45,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-01-10 01:40:45,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2025-01-10 01:40:45,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 35 states have internal predecessors, (40), 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:40:45,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2025-01-10 01:40:45,832 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 13 [2025-01-10 01:40:45,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:40:45,832 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-01-10 01:40:45,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 16 states have internal predecessors, (32), 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:40:45,832 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2025-01-10 01:40:45,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 01:40:45,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:40:45,832 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:40:45,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:40:46,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:40:46,037 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:40:46,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:40:46,037 INFO L85 PathProgramCache]: Analyzing trace with hash 381203162, now seen corresponding path program 1 times [2025-01-10 01:40:46,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:40:46,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458819498] [2025-01-10 01:40:46,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:40:46,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:40:46,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:40:46,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:40:46,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:40:46,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:40:46,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:40:46,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:40:46,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458819498] [2025-01-10 01:40:46,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458819498] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:40:46,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029183513] [2025-01-10 01:40:46,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:40:46,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:40:46,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:40:46,247 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:40:46,248 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:40:46,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:40:46,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:40:46,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:40:46,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:40:46,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 01:40:46,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:40:46,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 01:40:46,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 01:40:46,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 01:40:46,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-01-10 01:40:46,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 01:40:46,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 01:40:46,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:40:46,637 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:40:46,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:40:46,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029183513] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:40:46,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:40:46,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-01-10 01:40:46,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986955936] [2025-01-10 01:40:46,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:40:46,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:40:46,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:40:46,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:40:46,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:40:46,733 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 17 states, 16 states have (on average 2.5) internal successors, (40), 17 states have internal predecessors, (40), 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:40:46,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:40:46,899 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2025-01-10 01:40:46,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 01:40:46,900 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.5) internal successors, (40), 17 states have internal predecessors, (40), 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 14 [2025-01-10 01:40:46,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:40:46,900 INFO L225 Difference]: With dead ends: 37 [2025-01-10 01:40:46,900 INFO L226 Difference]: Without dead ends: 36 [2025-01-10 01:40:46,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2025-01-10 01:40:46,901 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 30 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:40:46,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 13 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:40:46,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-01-10 01:40:46,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2025-01-10 01:40:46,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 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:40:46,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2025-01-10 01:40:46,904 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 14 [2025-01-10 01:40:46,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:40:46,904 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2025-01-10 01:40:46,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.5) internal successors, (40), 17 states have internal predecessors, (40), 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:40:46,905 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2025-01-10 01:40:46,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 01:40:46,905 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:40:46,905 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:40:46,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:40:47,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:40:47,106 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:40:47,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:40:47,106 INFO L85 PathProgramCache]: Analyzing trace with hash -752617376, now seen corresponding path program 1 times [2025-01-10 01:40:47,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:40:47,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174812711] [2025-01-10 01:40:47,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:40:47,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:40:47,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:40:47,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:40:47,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:40:47,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:40:47,187 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:40:47,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:40:47,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174812711] [2025-01-10 01:40:47,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174812711] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:40:47,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762072042] [2025-01-10 01:40:47,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:40:47,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:40:47,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:40:47,190 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:40:47,191 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:40:47,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:40:47,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:40:47,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:40:47,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:40:47,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:40:47,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:40:47,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 01:40:47,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 01:40:47,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 01:40:47,283 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:40:47,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:40:47,326 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:40:47,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762072042] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:40:47,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:40:47,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 01:40:47,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184200882] [2025-01-10 01:40:47,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:40:47,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:40:47,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:40:47,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:40:47,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:40:47,328 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 12 states have internal predecessors, (43), 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:40:47,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:40:47,381 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2025-01-10 01:40:47,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:40:47,381 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 12 states have internal predecessors, (43), 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:40:47,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:40:47,382 INFO L225 Difference]: With dead ends: 55 [2025-01-10 01:40:47,382 INFO L226 Difference]: Without dead ends: 54 [2025-01-10 01:40:47,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:40:47,382 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:40:47,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 72 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:40:47,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-10 01:40:47,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2025-01-10 01:40:47,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 45 states have (on average 1.2) internal successors, (54), 48 states have internal predecessors, (54), 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:40:47,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2025-01-10 01:40:47,386 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 18 [2025-01-10 01:40:47,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:40:47,386 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2025-01-10 01:40:47,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 12 states have internal predecessors, (43), 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:40:47,386 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2025-01-10 01:40:47,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-10 01:40:47,386 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:40:47,386 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 01:40:47,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:40:47,587 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:40:47,587 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:40:47,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:40:47,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1856302123, now seen corresponding path program 1 times [2025-01-10 01:40:47,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:40:47,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061923981] [2025-01-10 01:40:47,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:40:47,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:40:47,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:40:47,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:40:47,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:40:47,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:40:47,730 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:40:47,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:40:47,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061923981] [2025-01-10 01:40:47,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061923981] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:40:47,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756048022] [2025-01-10 01:40:47,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:40:47,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:40:47,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:40:47,732 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:40:47,734 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:40:47,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:40:47,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:40:47,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:40:47,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:40:47,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 01:40:47,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:40:47,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 01:40:47,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 01:40:47,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 01:40:47,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 01:40:47,850 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:40:47,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:40:47,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-01-10 01:40:47,947 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:40:47,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756048022] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:40:47,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:40:47,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-01-10 01:40:47,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695308797] [2025-01-10 01:40:47,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:40:47,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:40:47,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:40:47,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:40:47,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:40:47,948 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 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:40:48,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:40:48,066 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2025-01-10 01:40:48,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:40:48,066 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 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 19 [2025-01-10 01:40:48,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:40:48,066 INFO L225 Difference]: With dead ends: 49 [2025-01-10 01:40:48,066 INFO L226 Difference]: Without dead ends: 48 [2025-01-10 01:40:48,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2025-01-10 01:40:48,067 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 40 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:40:48,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 28 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:40:48,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-10 01:40:48,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-01-10 01:40:48,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 47 states have internal predecessors, (51), 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:40:48,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2025-01-10 01:40:48,072 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 19 [2025-01-10 01:40:48,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:40:48,072 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2025-01-10 01:40:48,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 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:40:48,072 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2025-01-10 01:40:48,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-10 01:40:48,072 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:40:48,072 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-01-10 01:40:48,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 01:40:48,273 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:40:48,273 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:40:48,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:40:48,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1710790910, now seen corresponding path program 1 times [2025-01-10 01:40:48,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:40:48,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480020337] [2025-01-10 01:40:48,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:40:48,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:40:48,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:40:48,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:40:48,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:40:48,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:40:48,366 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:40:48,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:40:48,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480020337] [2025-01-10 01:40:48,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480020337] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:40:48,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094713365] [2025-01-10 01:40:48,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:40:48,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:40:48,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:40:48,373 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:40:48,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 01:40:48,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:40:48,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:40:48,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:40:48,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:40:48,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:40:48,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:40:48,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 01:40:48,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-01-10 01:40:48,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 01:40:48,456 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:40:48,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:40:48,507 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:40:48,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094713365] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:40:48,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:40:48,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2025-01-10 01:40:48,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351056409] [2025-01-10 01:40:48,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:40:48,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:40:48,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:40:48,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:40:48,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:40:48,508 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 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:40:48,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:40:48,521 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2025-01-10 01:40:48,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:40:48,521 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 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 20 [2025-01-10 01:40:48,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:40:48,521 INFO L225 Difference]: With dead ends: 48 [2025-01-10 01:40:48,521 INFO L226 Difference]: Without dead ends: 47 [2025-01-10 01:40:48,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:40:48,522 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:40:48,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 18 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:40:48,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-01-10 01:40:48,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-01-10 01:40:48,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 46 states have internal predecessors, (48), 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:40:48,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2025-01-10 01:40:48,525 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 20 [2025-01-10 01:40:48,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:40:48,525 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2025-01-10 01:40:48,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 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:40:48,525 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2025-01-10 01:40:48,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-10 01:40:48,525 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:40:48,525 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2025-01-10 01:40:48,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 01:40:48,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:40:48,726 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:40:48,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:40:48,727 INFO L85 PathProgramCache]: Analyzing trace with hash 300106702, now seen corresponding path program 2 times [2025-01-10 01:40:48,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:40:48,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033910456] [2025-01-10 01:40:48,727 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:40:48,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:40:48,734 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-10 01:40:48,739 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:40:48,740 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:40:48,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:40:49,092 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:40:49,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:40:49,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033910456] [2025-01-10 01:40:49,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033910456] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:40:49,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328774774] [2025-01-10 01:40:49,092 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:40:49,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:40:49,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:40:49,094 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:40:49,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 01:40:49,152 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-10 01:40:49,166 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:40:49,166 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:40:49,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:40:49,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-10 01:40:49,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:40:49,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 01:40:49,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 01:40:49,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 01:40:49,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-01-10 01:40:49,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 01:40:49,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 01:40:49,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 01:40:49,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 01:40:49,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 01:40:49,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 01:40:49,555 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:40:49,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:40:49,750 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:40:49,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328774774] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:40:49,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:40:49,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2025-01-10 01:40:49,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604295536] [2025-01-10 01:40:49,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:40:49,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-01-10 01:40:49,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:40:49,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-01-10 01:40:49,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=1000, Unknown=0, NotChecked=0, Total=1260 [2025-01-10 01:40:49,753 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 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:40:50,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:40:50,076 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2025-01-10 01:40:50,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-10 01:40:50,077 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 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 31 [2025-01-10 01:40:50,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:40:50,077 INFO L225 Difference]: With dead ends: 78 [2025-01-10 01:40:50,077 INFO L226 Difference]: Without dead ends: 77 [2025-01-10 01:40:50,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 890 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=474, Invalid=2076, Unknown=0, NotChecked=0, Total=2550 [2025-01-10 01:40:50,079 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 54 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:40:50,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 30 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:40:50,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-01-10 01:40:50,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2025-01-10 01:40:50,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 68 states have internal predecessors, (71), 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:40:50,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2025-01-10 01:40:50,084 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 31 [2025-01-10 01:40:50,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:40:50,084 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2025-01-10 01:40:50,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 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:40:50,085 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2025-01-10 01:40:50,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-10 01:40:50,085 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:40:50,085 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1] [2025-01-10 01:40:50,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 01:40:50,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-10 01:40:50,291 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:40:50,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:40:50,292 INFO L85 PathProgramCache]: Analyzing trace with hash -373538070, now seen corresponding path program 2 times [2025-01-10 01:40:50,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:40:50,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122920141] [2025-01-10 01:40:50,292 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:40:50,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:40:50,306 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-01-10 01:40:50,313 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 01:40:50,313 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:40:50,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:40:50,413 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-01-10 01:40:50,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:40:50,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122920141] [2025-01-10 01:40:50,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122920141] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:40:50,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:40:50,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:40:50,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794353264] [2025-01-10 01:40:50,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:40:50,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:40:50,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:40:50,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:40:50,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:40:50,414 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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:40:50,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:40:50,493 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2025-01-10 01:40:50,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:40:50,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-01-10 01:40:50,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:40:50,494 INFO L225 Difference]: With dead ends: 69 [2025-01-10 01:40:50,494 INFO L226 Difference]: Without dead ends: 68 [2025-01-10 01:40:50,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:40:50,494 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 18 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:40:50,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 10 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:40:50,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-01-10 01:40:50,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-01-10 01:40:50,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.0149253731343284) internal successors, (68), 67 states have internal predecessors, (68), 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:40:50,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2025-01-10 01:40:50,498 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 45 [2025-01-10 01:40:50,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:40:50,498 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2025-01-10 01:40:50,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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:40:50,499 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2025-01-10 01:40:50,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-10 01:40:50,502 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:40:50,502 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1] [2025-01-10 01:40:50,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:40:50,502 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:40:50,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:40:50,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1121952434, now seen corresponding path program 3 times [2025-01-10 01:40:50,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:40:50,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908275853] [2025-01-10 01:40:50,503 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:40:50,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:40:50,516 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 8 equivalence classes. [2025-01-10 01:40:50,521 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 22 of 67 statements. [2025-01-10 01:40:50,521 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-10 01:40:50,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:40:50,669 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 61 proven. 1 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2025-01-10 01:40:50,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:40:50,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908275853] [2025-01-10 01:40:50,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908275853] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:40:50,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648765201] [2025-01-10 01:40:50,670 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:40:50,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:40:50,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:40:50,676 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:40:50,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 01:40:50,733 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 8 equivalence classes. [2025-01-10 01:40:50,745 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 22 of 67 statements. [2025-01-10 01:40:50,745 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-10 01:40:50,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:40:50,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 01:40:50,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:40:50,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 19 [2025-01-10 01:40:50,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 17 [2025-01-10 01:40:50,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-01-10 01:40:50,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-10 01:40:50,890 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 61 proven. 1 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2025-01-10 01:40:50,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:40:50,972 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 61 proven. 1 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2025-01-10 01:40:50,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648765201] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:40:50,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:40:50,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-01-10 01:40:50,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636890406] [2025-01-10 01:40:50,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:40:50,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:40:50,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:40:50,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:40:50,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:40:50,973 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand has 17 states, 16 states have (on average 2.625) internal successors, (42), 17 states have internal predecessors, (42), 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:40:51,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:40:51,024 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2025-01-10 01:40:51,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:40:51,024 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.625) internal successors, (42), 17 states have internal predecessors, (42), 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 67 [2025-01-10 01:40:51,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:40:51,024 INFO L225 Difference]: With dead ends: 68 [2025-01-10 01:40:51,024 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 01:40:51,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2025-01-10 01:40:51,025 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 20 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:40:51,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 10 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:40:51,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 01:40:51,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 01:40:51,025 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:40:51,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 01:40:51,026 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2025-01-10 01:40:51,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:40:51,026 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 01:40:51,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.625) internal successors, (42), 17 states have internal predecessors, (42), 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:40:51,026 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 01:40:51,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 01:40:51,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-01-10 01:40:51,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-01-10 01:40:51,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-01-10 01:40:51,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-01-10 01:40:51,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-01-10 01:40:51,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-01-10 01:40:51,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 01:40:51,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:40:51,231 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:40:51,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 01:40:51,270 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:40:51,275 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-10 01:40:51,276 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-10 01:40:51,276 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~j~0!base,]]] [2025-01-10 01:40:51,277 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-01-10 01:40:51,277 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-01-10 01:40:51,277 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~i~0!base,]]] [2025-01-10 01:40:51,277 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-01-10 01:40:51,277 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-01-10 01:40:51,277 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~i~0!base,]]] [2025-01-10 01:40:51,277 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-10 01:40:51,277 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-10 01:40:51,277 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~j~0!base,]]] [2025-01-10 01:40:51,277 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-10 01:40:51,277 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-10 01:40:51,277 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~j~0!base,]]] [2025-01-10 01:40:51,277 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-01-10 01:40:51,277 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-01-10 01:40:51,277 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~i~0!base,]]] [2025-01-10 01:40:51,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:40:51 BoogieIcfgContainer [2025-01-10 01:40:51,277 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:40:51,278 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:40:51,278 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:40:51,278 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:40:51,278 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:40:44" (3/4) ... [2025-01-10 01:40:51,280 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:40:51,285 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-01-10 01:40:51,285 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 01:40:51,285 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-10 01:40:51,285 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-10 01:40:51,341 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:40:51,341 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:40:51,341 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:40:51,342 INFO L158 Benchmark]: Toolchain (without parser) took 7678.15ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 112.0MB in the beginning and 74.5MB in the end (delta: 37.5MB). Peak memory consumption was 69.0MB. Max. memory is 16.1GB. [2025-01-10 01:40:51,342 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:40:51,342 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.42ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 96.1MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 01:40:51,342 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.04ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 94.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:40:51,342 INFO L158 Benchmark]: Boogie Preprocessor took 32.01ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:40:51,342 INFO L158 Benchmark]: RCFGBuilder took 195.76ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 82.2MB in the end (delta: 11.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:40:51,342 INFO L158 Benchmark]: TraceAbstraction took 7064.07ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 81.8MB in the beginning and 81.0MB in the end (delta: 767.9kB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. [2025-01-10 01:40:51,344 INFO L158 Benchmark]: Witness Printer took 63.20ms. Allocated memory is still 176.2MB. Free memory was 81.0MB in the beginning and 74.5MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:40:51,345 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.18ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.42ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 96.1MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.04ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 94.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.01ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 195.76ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 82.2MB in the end (delta: 11.2MB). There was no memory consumed. Max. memory is 16.1GB. * TraceAbstraction took 7064.07ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 81.8MB in the beginning and 81.0MB in the end (delta: 767.9kB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. * Witness Printer took 63.20ms. Allocated memory is still 176.2MB. Free memory was 81.0MB in the beginning and 74.5MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~j~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~i~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~i~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~j~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~j~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~i~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 550]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 550]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 551]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 551]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 550]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 550]: 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, 21 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 12, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 249 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 249 mSDsluCounter, 335 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 247 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 832 IncrementalHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 88 mSDtfsCounter, 832 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 469 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1246 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=10, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 31 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 440 NumberOfCodeBlocks, 350 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 596 ConstructedInterpolants, 0 QuantifiedInterpolants, 3967 SizeOfPredicates, 39 NumberOfNonLiveVariables, 650 ConjunctsInSsa, 117 ConjunctsInUnsatCore, 26 InterpolantComputations, 6 PerfectInterpolantSequences, 700/877 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 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 01:40:51,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE