./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-crafted/xor3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc 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/array-crafted/xor3.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c89c2ec3a6d8d6162c4c4ac97fed99fb9c343c7a2c2e60d87226da2b47103d07 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:19:52,116 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:19:52,191 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 13:19:52,195 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:19:52,195 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:19:52,214 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:19:52,215 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:19:52,215 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:19:52,215 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:19:52,215 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:19:52,215 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:19:52,215 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:19:52,216 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:19:52,216 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:19:52,216 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:19:52,216 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:19:52,216 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 13:19:52,216 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:19:52,216 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:19:52,216 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:19:52,216 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:19:52,216 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 13:19:52,216 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:19:52,216 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 13:19:52,217 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 13:19:52,217 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:19:52,217 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:19:52,217 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 13:19:52,217 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:19:52,217 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:19:52,217 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:19:52,217 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:19:52,217 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:19:52,217 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:19:52,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:19:52,217 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:19:52,217 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:19:52,217 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 13:19:52,218 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 13:19:52,218 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:19:52,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:19:52,218 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:19:52,218 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:19:52,218 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:19:52,218 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:19:52,218 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c89c2ec3a6d8d6162c4c4ac97fed99fb9c343c7a2c2e60d87226da2b47103d07 [2025-02-06 13:19:52,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:19:52,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:19:52,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:19:52,470 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:19:52,470 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:19:52,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/xor3.i [2025-02-06 13:19:53,870 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/415b19bef/9340b82acccf4ad1a2344dfec594be3e/FLAGa059a4b4a [2025-02-06 13:19:54,140 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:19:54,141 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-crafted/xor3.i [2025-02-06 13:19:54,146 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/415b19bef/9340b82acccf4ad1a2344dfec594be3e/FLAGa059a4b4a [2025-02-06 13:19:54,426 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/415b19bef/9340b82acccf4ad1a2344dfec594be3e [2025-02-06 13:19:54,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:19:54,431 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:19:54,433 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:19:54,433 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:19:54,437 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:19:54,437 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:19:54" (1/1) ... [2025-02-06 13:19:54,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54c292c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:19:54, skipping insertion in model container [2025-02-06 13:19:54,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:19:54" (1/1) ... [2025-02-06 13:19:54,467 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:19:54,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:19:54,651 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:19:54,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:19:54,672 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:19:54,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:19:54 WrapperNode [2025-02-06 13:19:54,673 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:19:54,674 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:19:54,674 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:19:54,674 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:19:54,678 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:19:54" (1/1) ... [2025-02-06 13:19:54,683 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:19:54" (1/1) ... [2025-02-06 13:19:54,696 INFO L138 Inliner]: procedures = 16, calls = 31, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2025-02-06 13:19:54,697 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:19:54,698 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:19:54,698 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:19:54,698 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:19:54,705 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:19:54" (1/1) ... [2025-02-06 13:19:54,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:19:54" (1/1) ... [2025-02-06 13:19:54,708 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:19:54" (1/1) ... [2025-02-06 13:19:54,721 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 7, 11]. 55 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0]. The 5 writes are split as follows [0, 0, 5]. [2025-02-06 13:19:54,722 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:19:54" (1/1) ... [2025-02-06 13:19:54,722 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:19:54" (1/1) ... [2025-02-06 13:19:54,727 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:19:54" (1/1) ... [2025-02-06 13:19:54,728 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:19:54" (1/1) ... [2025-02-06 13:19:54,729 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:19:54" (1/1) ... [2025-02-06 13:19:54,730 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:19:54" (1/1) ... [2025-02-06 13:19:54,731 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:19:54,732 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:19:54,732 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:19:54,732 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:19:54,733 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:19:54" (1/1) ... [2025-02-06 13:19:54,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:19:54,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:19:54,775 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 13:19:54,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 13:19:54,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:19:54,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:19:54,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 13:19:54,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 13:19:54,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 13:19:54,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 13:19:54,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 13:19:54,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 13:19:54,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:19:54,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:19:54,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 13:19:54,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 13:19:54,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 13:19:54,803 INFO L130 BoogieDeclarations]: Found specification of procedure xor [2025-02-06 13:19:54,803 INFO L138 BoogieDeclarations]: Found implementation of procedure xor [2025-02-06 13:19:54,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 13:19:54,876 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:19:54,878 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:19:55,039 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L31: call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset; [2025-02-06 13:19:55,080 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-02-06 13:19:55,080 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:19:55,091 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:19:55,091 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:19:55,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:19:55 BoogieIcfgContainer [2025-02-06 13:19:55,091 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:19:55,094 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:19:55,094 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:19:55,100 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:19:55,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:19:54" (1/3) ... [2025-02-06 13:19:55,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb21a10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:19:55, skipping insertion in model container [2025-02-06 13:19:55,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:19:54" (2/3) ... [2025-02-06 13:19:55,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb21a10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:19:55, skipping insertion in model container [2025-02-06 13:19:55,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:19:55" (3/3) ... [2025-02-06 13:19:55,105 INFO L128 eAbstractionObserver]: Analyzing ICFG xor3.i [2025-02-06 13:19:55,117 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:19:55,118 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG xor3.i that has 2 procedures, 42 locations, 1 initial locations, 3 loop locations, and 8 error locations. [2025-02-06 13:19:55,170 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:19:55,184 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;@4661a614, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:19:55,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 13:19:55,189 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 37 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 13:19:55,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 13:19:55,194 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:19:55,194 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 13:19:55,195 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:19:55,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:19:55,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1907583, now seen corresponding path program 1 times [2025-02-06 13:19:55,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:19:55,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103775786] [2025-02-06 13:19:55,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:55,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:19:55,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 13:19:55,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 13:19:55,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:55,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:55,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:19:55,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:19:55,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103775786] [2025-02-06 13:19:55,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103775786] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:19:55,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:19:55,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:19:55,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829029278] [2025-02-06 13:19:55,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:19:55,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:19:55,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:19:55,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:19:55,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:19:55,505 INFO L87 Difference]: Start difference. First operand has 42 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 37 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 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-02-06 13:19:55,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:55,555 INFO L93 Difference]: Finished difference Result 81 states and 99 transitions. [2025-02-06 13:19:55,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:19:55,557 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-02-06 13:19:55,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:55,562 INFO L225 Difference]: With dead ends: 81 [2025-02-06 13:19:55,562 INFO L226 Difference]: Without dead ends: 37 [2025-02-06 13:19:55,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:19:55,569 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:19:55,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 125 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:19:55,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-06 13:19:55,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-02-06 13:19:55,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.56) internal successors, (39), 33 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 13:19:55,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2025-02-06 13:19:55,602 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 4 [2025-02-06 13:19:55,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:55,602 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2025-02-06 13:19:55,602 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-02-06 13:19:55,602 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2025-02-06 13:19:55,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 13:19:55,603 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:19:55,603 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-06 13:19:55,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:19:55,603 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:19:55,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:19:55,605 INFO L85 PathProgramCache]: Analyzing trace with hash 994226459, now seen corresponding path program 1 times [2025-02-06 13:19:55,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:19:55,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569186357] [2025-02-06 13:19:55,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:55,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:19:55,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 13:19:55,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 13:19:55,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:55,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:55,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:19:55,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:19:55,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569186357] [2025-02-06 13:19:55,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569186357] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:19:55,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880689273] [2025-02-06 13:19:55,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:55,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:19:55,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:19:55,731 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:19:55,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 13:19:55,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 13:19:55,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 13:19:55,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:55,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:55,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:19:55,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:19:55,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:19:55,830 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:19:55,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880689273] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:19:55,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:19:55,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-06 13:19:55,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936995253] [2025-02-06 13:19:55,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:19:55,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:19:55,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:19:55,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:19:55,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:19:55,832 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:19:55,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:55,867 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2025-02-06 13:19:55,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:19:55,868 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 13:19:55,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:55,868 INFO L225 Difference]: With dead ends: 37 [2025-02-06 13:19:55,868 INFO L226 Difference]: Without dead ends: 36 [2025-02-06 13:19:55,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:19:55,869 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:19:55,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 133 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:19:55,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-06 13:19:55,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-02-06 13:19:55,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.52) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 13:19:55,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2025-02-06 13:19:55,873 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 7 [2025-02-06 13:19:55,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:55,873 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2025-02-06 13:19:55,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:19:55,873 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2025-02-06 13:19:55,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 13:19:55,874 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:19:55,874 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-02-06 13:19:55,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 13:19:56,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:19:56,078 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:19:56,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:19:56,080 INFO L85 PathProgramCache]: Analyzing trace with hash 756249153, now seen corresponding path program 1 times [2025-02-06 13:19:56,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:19:56,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581900342] [2025-02-06 13:19:56,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:56,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:19:56,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 13:19:56,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 13:19:56,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:56,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:56,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:19:56,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:19:56,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581900342] [2025-02-06 13:19:56,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581900342] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:19:56,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:19:56,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:19:56,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52911317] [2025-02-06 13:19:56,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:19:56,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:19:56,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:19:56,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:19:56,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:19:56,168 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:19:56,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:56,178 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2025-02-06 13:19:56,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:19:56,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 13:19:56,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:56,178 INFO L225 Difference]: With dead ends: 36 [2025-02-06 13:19:56,179 INFO L226 Difference]: Without dead ends: 35 [2025-02-06 13:19:56,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:19:56,179 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:19:56,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:19:56,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-06 13:19:56,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2025-02-06 13:19:56,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 13:19:56,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2025-02-06 13:19:56,183 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 8 [2025-02-06 13:19:56,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:56,183 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2025-02-06 13:19:56,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:19:56,183 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2025-02-06 13:19:56,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 13:19:56,183 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:19:56,183 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:19:56,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 13:19:56,184 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting xorErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:19:56,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:19:56,184 INFO L85 PathProgramCache]: Analyzing trace with hash -595686354, now seen corresponding path program 1 times [2025-02-06 13:19:56,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:19:56,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17157656] [2025-02-06 13:19:56,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:56,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:19:56,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:19:56,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:19:56,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:56,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:56,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:19:56,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:19:56,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17157656] [2025-02-06 13:19:56,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17157656] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:19:56,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278751178] [2025-02-06 13:19:56,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:56,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:19:56,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:19:56,236 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:19:56,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 13:19:56,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:19:56,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:19:56,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:56,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:56,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:19:56,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:19:56,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:19:56,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:19:56,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:19:56,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278751178] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:19:56,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:19:56,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 13:19:56,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951313703] [2025-02-06 13:19:56,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:19:56,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 13:19:56,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:19:56,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 13:19:56,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:19:56,353 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:19:56,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:56,379 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2025-02-06 13:19:56,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 13:19:56,380 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-06 13:19:56,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:56,380 INFO L225 Difference]: With dead ends: 66 [2025-02-06 13:19:56,380 INFO L226 Difference]: Without dead ends: 39 [2025-02-06 13:19:56,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:19:56,381 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:19:56,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:19:56,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-06 13:19:56,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-02-06 13:19:56,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 35 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 13:19:56,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2025-02-06 13:19:56,385 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 12 [2025-02-06 13:19:56,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:56,385 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2025-02-06 13:19:56,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:19:56,385 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2025-02-06 13:19:56,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 13:19:56,385 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:19:56,386 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:19:56,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 13:19:56,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:19:56,590 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting xorErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:19:56,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:19:56,590 INFO L85 PathProgramCache]: Analyzing trace with hash 841930414, now seen corresponding path program 2 times [2025-02-06 13:19:56,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:19:56,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587109982] [2025-02-06 13:19:56,591 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:19:56,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:19:56,599 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-06 13:19:56,602 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 18 statements. [2025-02-06 13:19:56,602 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:19:56,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:56,626 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 13:19:56,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:19:56,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587109982] [2025-02-06 13:19:56,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587109982] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:19:56,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:19:56,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:19:56,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878172502] [2025-02-06 13:19:56,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:19:56,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:19:56,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:19:56,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:19:56,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:19:56,628 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:19:56,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:56,657 INFO L93 Difference]: Finished difference Result 73 states and 93 transitions. [2025-02-06 13:19:56,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:19:56,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-06 13:19:56,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:56,663 INFO L225 Difference]: With dead ends: 73 [2025-02-06 13:19:56,663 INFO L226 Difference]: Without dead ends: 47 [2025-02-06 13:19:56,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:19:56,663 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:19:56,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 98 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:19:56,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-06 13:19:56,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-02-06 13:19:56,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 43 states have internal predecessors, (52), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 13:19:56,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2025-02-06 13:19:56,672 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 18 [2025-02-06 13:19:56,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:56,672 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2025-02-06 13:19:56,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:19:56,672 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2025-02-06 13:19:56,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 13:19:56,672 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:19:56,673 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:19:56,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 13:19:56,673 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting xorErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:19:56,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:19:56,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1356919021, now seen corresponding path program 1 times [2025-02-06 13:19:56,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:19:56,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943276822] [2025-02-06 13:19:56,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:56,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:19:56,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 13:19:56,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 13:19:56,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:56,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:56,804 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 13:19:56,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:19:56,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943276822] [2025-02-06 13:19:56,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943276822] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:19:56,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044225117] [2025-02-06 13:19:56,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:56,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:19:56,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:19:56,810 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:19:56,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 13:19:56,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 13:19:56,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 13:19:56,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:56,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:56,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 13:19:56,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:19:56,976 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 13:19:56,976 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:19:57,213 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 13:19:57,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044225117] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:19:57,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:19:57,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-02-06 13:19:57,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940536261] [2025-02-06 13:19:57,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:19:57,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 13:19:57,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:19:57,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 13:19:57,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-02-06 13:19:57,215 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:19:57,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:57,252 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2025-02-06 13:19:57,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 13:19:57,252 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-06 13:19:57,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:57,253 INFO L225 Difference]: With dead ends: 94 [2025-02-06 13:19:57,253 INFO L226 Difference]: Without dead ends: 59 [2025-02-06 13:19:57,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-02-06 13:19:57,254 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:19:57,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:19:57,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-06 13:19:57,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-02-06 13:19:57,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 55 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 13:19:57,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2025-02-06 13:19:57,258 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 23 [2025-02-06 13:19:57,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:57,258 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2025-02-06 13:19:57,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:19:57,258 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2025-02-06 13:19:57,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-06 13:19:57,259 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:19:57,259 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:19:57,265 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-02-06 13:19:57,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:19:57,463 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting xorErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:19:57,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:19:57,463 INFO L85 PathProgramCache]: Analyzing trace with hash -194044947, now seen corresponding path program 2 times [2025-02-06 13:19:57,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:19:57,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863024214] [2025-02-06 13:19:57,464 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:19:57,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:19:57,471 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-06 13:19:57,486 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 13:19:57,486 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:19:57,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:57,604 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-02-06 13:19:57,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:19:57,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863024214] [2025-02-06 13:19:57,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863024214] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:19:57,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389694609] [2025-02-06 13:19:57,605 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:19:57,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:19:57,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:19:57,610 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:19:57,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 13:19:57,651 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-06 13:19:57,691 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 13:19:57,691 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:19:57,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:57,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 13:19:57,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:19:57,861 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 13:19:57,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:19:58,155 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 13:19:58,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389694609] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:19:58,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:19:58,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 17, 17] total 36 [2025-02-06 13:19:58,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277116467] [2025-02-06 13:19:58,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:19:58,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-06 13:19:58,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:19:58,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-06 13:19:58,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=980, Unknown=0, NotChecked=0, Total=1260 [2025-02-06 13:19:58,160 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 36 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 36 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:19:58,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:58,268 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2025-02-06 13:19:58,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-06 13:19:58,269 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 36 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-02-06 13:19:58,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:58,269 INFO L225 Difference]: With dead ends: 117 [2025-02-06 13:19:58,269 INFO L226 Difference]: Without dead ends: 82 [2025-02-06 13:19:58,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=280, Invalid=980, Unknown=0, NotChecked=0, Total=1260 [2025-02-06 13:19:58,271 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 13 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:19:58,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 286 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:19:58,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-06 13:19:58,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-02-06 13:19:58,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 73 states have (on average 1.1917808219178083) internal successors, (87), 78 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 13:19:58,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2025-02-06 13:19:58,282 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 35 [2025-02-06 13:19:58,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:58,282 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2025-02-06 13:19:58,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 36 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:19:58,282 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2025-02-06 13:19:58,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-06 13:19:58,284 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:19:58,284 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:19:58,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 13:19:58,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-06 13:19:58,485 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting xorErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:19:58,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:19:58,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1185696696, now seen corresponding path program 1 times [2025-02-06 13:19:58,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:19:58,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963547554] [2025-02-06 13:19:58,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:58,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:19:58,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 13:19:58,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 13:19:58,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:58,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:58,564 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2025-02-06 13:19:58,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:19:58,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963547554] [2025-02-06 13:19:58,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963547554] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:19:58,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:19:58,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:19:58,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676633762] [2025-02-06 13:19:58,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:19:58,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:19:58,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:19:58,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:19:58,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:19:58,567 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:19:58,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:58,581 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2025-02-06 13:19:58,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:19:58,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-02-06 13:19:58,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:58,582 INFO L225 Difference]: With dead ends: 82 [2025-02-06 13:19:58,583 INFO L226 Difference]: Without dead ends: 80 [2025-02-06 13:19:58,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:19:58,583 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:19:58,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 88 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:19:58,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-06 13:19:58,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2025-02-06 13:19:58,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.1363636363636365) internal successors, (75), 69 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 13:19:58,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2025-02-06 13:19:58,592 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 60 [2025-02-06 13:19:58,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:58,592 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2025-02-06 13:19:58,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:19:58,593 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2025-02-06 13:19:58,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 13:19:58,594 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:19:58,594 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:19:58,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 13:19:58,595 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:19:58,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:19:58,595 INFO L85 PathProgramCache]: Analyzing trace with hash -235272774, now seen corresponding path program 1 times [2025-02-06 13:19:58,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:19:58,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502096608] [2025-02-06 13:19:58,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:58,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:19:58,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 13:19:58,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 13:19:58,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:58,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:58,824 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2025-02-06 13:19:58,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:19:58,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502096608] [2025-02-06 13:19:58,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502096608] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:19:58,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418223768] [2025-02-06 13:19:58,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:58,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:19:58,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:19:58,829 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:19:58,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 13:19:58,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 13:19:58,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 13:19:58,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:58,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:58,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 13:19:58,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:19:58,957 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-02-06 13:19:58,957 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:19:58,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418223768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:19:58,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:19:58,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-06 13:19:58,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098093403] [2025-02-06 13:19:58,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:19:58,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:19:58,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:19:58,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:19:58,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:19:58,959 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:19:58,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:58,975 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2025-02-06 13:19:58,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:19:58,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 72 [2025-02-06 13:19:58,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:58,976 INFO L225 Difference]: With dead ends: 77 [2025-02-06 13:19:58,976 INFO L226 Difference]: Without dead ends: 76 [2025-02-06 13:19:58,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:19:58,976 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:19:58,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 56 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:19:58,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-02-06 13:19:58,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2025-02-06 13:19:58,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 71 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 13:19:58,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2025-02-06 13:19:58,980 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 72 [2025-02-06 13:19:58,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:58,981 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2025-02-06 13:19:58,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:19:58,981 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2025-02-06 13:19:58,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 13:19:58,982 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:19:58,982 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:19:58,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 13:19:59,182 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-02-06 13:19:59,182 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:19:59,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:19:59,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1296478584, now seen corresponding path program 1 times [2025-02-06 13:19:59,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:19:59,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940442693] [2025-02-06 13:19:59,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:59,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:19:59,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 13:19:59,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 13:19:59,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:59,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:59,324 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2025-02-06 13:19:59,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:19:59,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940442693] [2025-02-06 13:19:59,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940442693] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:19:59,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662129241] [2025-02-06 13:19:59,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:59,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:19:59,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:19:59,326 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:19:59,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 13:19:59,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 13:19:59,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 13:19:59,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:59,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:59,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 13:19:59,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:19:59,437 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-02-06 13:19:59,437 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:19:59,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662129241] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:19:59,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:19:59,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-06 13:19:59,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512410838] [2025-02-06 13:19:59,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:19:59,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:19:59,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:19:59,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:19:59,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:19:59,441 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:19:59,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:59,454 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2025-02-06 13:19:59,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:19:59,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 73 [2025-02-06 13:19:59,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:59,456 INFO L225 Difference]: With dead ends: 77 [2025-02-06 13:19:59,456 INFO L226 Difference]: Without dead ends: 76 [2025-02-06 13:19:59,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:19:59,456 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:19:59,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:19:59,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-02-06 13:19:59,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-02-06 13:19:59,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 72 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 13:19:59,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2025-02-06 13:19:59,462 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 73 [2025-02-06 13:19:59,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:59,463 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2025-02-06 13:19:59,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:19:59,463 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2025-02-06 13:19:59,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-06 13:19:59,463 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:19:59,463 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:19:59,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 13:19:59,664 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-02-06 13:19:59,664 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:19:59,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:19:59,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1536130424, now seen corresponding path program 1 times [2025-02-06 13:19:59,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:19:59,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100554741] [2025-02-06 13:19:59,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:59,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:19:59,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 13:19:59,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 13:19:59,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:59,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:59,809 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2025-02-06 13:19:59,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:19:59,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100554741] [2025-02-06 13:19:59,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100554741] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:19:59,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783627876] [2025-02-06 13:19:59,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:59,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:19:59,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:19:59,815 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:19:59,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 13:19:59,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 13:19:59,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 13:19:59,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:59,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:59,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 13:19:59,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:20:00,615 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 13:20:00,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:20:01,477 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 13:20:01,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783627876] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:20:01,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:20:01,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 33, 33] total 67 [2025-02-06 13:20:01,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66897249] [2025-02-06 13:20:01,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:20:01,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-02-06 13:20:01,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:20:01,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-02-06 13:20:01,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1063, Invalid=3359, Unknown=0, NotChecked=0, Total=4422 [2025-02-06 13:20:01,480 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 67 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 67 states have internal predecessors, (129), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 13:20:01,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:20:01,637 INFO L93 Difference]: Finished difference Result 165 states and 201 transitions. [2025-02-06 13:20:01,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-02-06 13:20:01,638 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 67 states have internal predecessors, (129), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 74 [2025-02-06 13:20:01,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:20:01,639 INFO L225 Difference]: With dead ends: 165 [2025-02-06 13:20:01,639 INFO L226 Difference]: Without dead ends: 137 [2025-02-06 13:20:01,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1063, Invalid=3359, Unknown=0, NotChecked=0, Total=4422 [2025-02-06 13:20:01,641 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 14 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:20:01,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 385 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:20:01,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-02-06 13:20:01,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 132. [2025-02-06 13:20:01,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 125 states have (on average 1.096) internal successors, (137), 128 states have internal predecessors, (137), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 13:20:01,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2025-02-06 13:20:01,655 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 74 [2025-02-06 13:20:01,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:20:01,655 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2025-02-06 13:20:01,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 67 states have internal predecessors, (129), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 13:20:01,655 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2025-02-06 13:20:01,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 13:20:01,659 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:20:01,659 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:20:01,681 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-02-06 13:20:01,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:20:01,860 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:20:01,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:20:01,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1768017778, now seen corresponding path program 2 times [2025-02-06 13:20:01,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:20:01,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219740427] [2025-02-06 13:20:01,861 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:20:01,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:20:01,879 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 132 statements into 2 equivalence classes. [2025-02-06 13:20:01,881 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 132 statements. [2025-02-06 13:20:01,881 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:20:01,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:20:01,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1468 trivial. 0 not checked. [2025-02-06 13:20:01,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:20:01,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219740427] [2025-02-06 13:20:01,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219740427] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:20:01,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:20:01,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:20:01,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240483706] [2025-02-06 13:20:01,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:20:01,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:20:01,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:20:01,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:20:01,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:20:01,905 INFO L87 Difference]: Start difference. First operand 132 states and 141 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:20:01,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:20:01,920 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2025-02-06 13:20:01,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:20:01,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 132 [2025-02-06 13:20:01,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:20:01,922 INFO L225 Difference]: With dead ends: 132 [2025-02-06 13:20:01,922 INFO L226 Difference]: Without dead ends: 130 [2025-02-06 13:20:01,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:20:01,922 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:20:01,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 72 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:20:01,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-02-06 13:20:01,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-02-06 13:20:01,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 125 states have (on average 1.08) internal successors, (135), 126 states have internal predecessors, (135), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 13:20:01,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2025-02-06 13:20:01,931 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 132 [2025-02-06 13:20:01,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:20:01,931 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2025-02-06 13:20:01,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:20:01,931 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2025-02-06 13:20:01,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-06 13:20:01,932 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:20:01,932 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:20:01,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 13:20:01,932 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:20:01,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:20:01,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1026023712, now seen corresponding path program 1 times [2025-02-06 13:20:01,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:20:01,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458727803] [2025-02-06 13:20:01,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:20:01,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:20:01,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 13:20:01,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 13:20:01,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:20:01,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:20:02,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1468 trivial. 0 not checked. [2025-02-06 13:20:02,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:20:02,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458727803] [2025-02-06 13:20:02,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458727803] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:20:02,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:20:02,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:20:02,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480648766] [2025-02-06 13:20:02,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:20:02,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:20:02,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:20:02,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:20:02,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:20:02,102 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:20:02,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:20:02,123 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2025-02-06 13:20:02,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:20:02,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 133 [2025-02-06 13:20:02,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:20:02,124 INFO L225 Difference]: With dead ends: 133 [2025-02-06 13:20:02,124 INFO L226 Difference]: Without dead ends: 132 [2025-02-06 13:20:02,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:20:02,125 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:20:02,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:20:02,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-02-06 13:20:02,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-02-06 13:20:02,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 127 states have (on average 1.078740157480315) internal successors, (137), 128 states have internal predecessors, (137), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 13:20:02,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2025-02-06 13:20:02,133 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 133 [2025-02-06 13:20:02,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:20:02,133 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2025-02-06 13:20:02,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:20:02,134 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2025-02-06 13:20:02,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 13:20:02,135 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:20:02,135 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:20:02,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 13:20:02,135 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:20:02,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:20:02,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1009851436, now seen corresponding path program 1 times [2025-02-06 13:20:02,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:20:02,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593200000] [2025-02-06 13:20:02,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:20:02,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:20:02,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 13:20:02,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 13:20:02,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:20:02,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:20:02,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1469 trivial. 0 not checked. [2025-02-06 13:20:02,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:20:02,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593200000] [2025-02-06 13:20:02,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593200000] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:20:02,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:20:02,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:20:02,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483949785] [2025-02-06 13:20:02,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:20:02,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:20:02,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:20:02,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:20:02,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:20:02,232 INFO L87 Difference]: Start difference. First operand 132 states and 141 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:20:02,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:20:02,242 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2025-02-06 13:20:02,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:20:02,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 136 [2025-02-06 13:20:02,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:20:02,243 INFO L225 Difference]: With dead ends: 132 [2025-02-06 13:20:02,243 INFO L226 Difference]: Without dead ends: 131 [2025-02-06 13:20:02,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:20:02,244 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:20:02,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:20:02,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-06 13:20:02,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-02-06 13:20:02,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 127 states have (on average 1.0708661417322836) internal successors, (136), 127 states have internal predecessors, (136), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 13:20:02,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2025-02-06 13:20:02,249 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 136 [2025-02-06 13:20:02,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:20:02,250 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2025-02-06 13:20:02,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:20:02,250 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2025-02-06 13:20:02,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-06 13:20:02,251 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:20:02,251 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:20:02,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 13:20:02,251 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:20:02,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:20:02,252 INFO L85 PathProgramCache]: Analyzing trace with hash 195378386, now seen corresponding path program 1 times [2025-02-06 13:20:02,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:20:02,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404766204] [2025-02-06 13:20:02,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:20:02,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:20:02,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-06 13:20:02,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-06 13:20:02,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:20:02,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:20:02,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1473 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1469 trivial. 0 not checked. [2025-02-06 13:20:02,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:20:02,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404766204] [2025-02-06 13:20:02,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404766204] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:20:02,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:20:02,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:20:02,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080262559] [2025-02-06 13:20:02,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:20:02,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:20:02,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:20:02,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:20:02,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:20:02,368 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:20:02,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:20:02,384 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2025-02-06 13:20:02,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:20:02,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 138 [2025-02-06 13:20:02,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:20:02,385 INFO L225 Difference]: With dead ends: 131 [2025-02-06 13:20:02,385 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 13:20:02,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:20:02,385 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:20:02,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:20:02,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 13:20:02,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 13:20:02,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:20:02,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 13:20:02,386 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 138 [2025-02-06 13:20:02,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:20:02,386 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 13:20:02,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:20:02,386 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 13:20:02,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 13:20:02,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-02-06 13:20:02,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-02-06 13:20:02,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-02-06 13:20:02,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-02-06 13:20:02,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-02-06 13:20:02,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-02-06 13:20:02,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location xorErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-02-06 13:20:02,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location xorErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-02-06 13:20:02,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 13:20:02,391 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:20:02,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 13:20:02,426 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 13:20:02,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:20:02 BoogieIcfgContainer [2025-02-06 13:20:02,434 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 13:20:02,434 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 13:20:02,434 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 13:20:02,435 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 13:20:02,435 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:19:55" (3/4) ... [2025-02-06 13:20:02,436 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 13:20:02,439 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure xor [2025-02-06 13:20:02,442 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-02-06 13:20:02,442 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-06 13:20:02,442 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 13:20:02,442 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 13:20:02,442 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 13:20:02,494 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 13:20:02,494 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 13:20:02,495 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 13:20:02,495 INFO L158 Benchmark]: Toolchain (without parser) took 8064.43ms. Allocated memory was 167.8MB in the beginning and 394.3MB in the end (delta: 226.5MB). Free memory was 122.8MB in the beginning and 209.0MB in the end (delta: -86.2MB). Peak memory consumption was 135.8MB. Max. memory is 16.1GB. [2025-02-06 13:20:02,495 INFO L158 Benchmark]: CDTParser took 2.45ms. Allocated memory is still 201.3MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:20:02,495 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.47ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 111.2MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:20:02,496 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.36ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 110.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:20:02,496 INFO L158 Benchmark]: Boogie Preprocessor took 33.62ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 108.8MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:20:02,496 INFO L158 Benchmark]: IcfgBuilder took 359.49ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 93.2MB in the end (delta: 15.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:20:02,496 INFO L158 Benchmark]: TraceAbstraction took 7340.21ms. Allocated memory was 167.8MB in the beginning and 394.3MB in the end (delta: 226.5MB). Free memory was 92.6MB in the beginning and 215.7MB in the end (delta: -123.1MB). Peak memory consumption was 102.3MB. Max. memory is 16.1GB. [2025-02-06 13:20:02,496 INFO L158 Benchmark]: Witness Printer took 60.25ms. Allocated memory is still 394.3MB. Free memory was 215.7MB in the beginning and 209.0MB in the end (delta: 6.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:20:02,497 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.45ms. Allocated memory is still 201.3MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 240.47ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 111.2MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.36ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 110.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.62ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 108.8MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 359.49ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 93.2MB in the end (delta: 15.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7340.21ms. Allocated memory was 167.8MB in the beginning and 394.3MB in the end (delta: 226.5MB). Free memory was 92.6MB in the beginning and 215.7MB in the end (delta: -123.1MB). Peak memory consumption was 102.3MB. Max. memory is 16.1GB. * Witness Printer took 60.25ms. Allocated memory is still 394.3MB. Free memory was 215.7MB in the beginning and 209.0MB in the end (delta: 6.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 42 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 7.2s, OverallIterations: 15, TraceHistogramMax: 31, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 45 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 45 mSDsluCounter, 1875 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1398 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 617 IncrementalHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 477 mSDtfsCounter, 617 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 490 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1507 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=11, InterpolantAutomatonStates: 165, 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, 15 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1221 NumberOfCodeBlocks, 1093 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1339 ConstructedInterpolants, 0 QuantifiedInterpolants, 1833 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1465 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 26 InterpolantComputations, 11 PerfectInterpolantSequences, 8030/8908 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 8 specifications checked. All of them hold - InvariantResult [Line: 23]: Location Invariant Derived location invariant: ((i == 1) || (1 < i)) - InvariantResult [Line: 46]: Location Invariant Derived location invariant: (0 < (2147483650 + i)) - InvariantResult [Line: 37]: Location Invariant Derived location invariant: ((i == 0) || (0 < i)) RESULT: Ultimate proved your program to be correct! [2025-02-06 13:20:02,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE