./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/NestedRecursion_2b.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted/NestedRecursion_2b.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 422ea435de955cc6e58e578076c5ef733a2456157ad413df035d109cb231427a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:26:29,732 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:26:29,787 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 01:26:29,791 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:26:29,792 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:26:29,823 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:26:29,824 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:26:29,824 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:26:29,824 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:26:29,824 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:26:29,824 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:26:29,824 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:26:29,825 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:26:29,825 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:26:29,825 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:26:29,825 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:26:29,829 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:26:29,829 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:26:29,829 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:26:29,830 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:26:29,830 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:26:29,830 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:26:29,830 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:26:29,830 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:26:29,830 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:26:29,830 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:26:29,830 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:26:29,830 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:26:29,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:26:29,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:26:29,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:26:29,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:26:29,830 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:26:29,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:26:29,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:26:29,831 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:26:29,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:26:29,831 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:26:29,831 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:26:29,831 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:26:29,831 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:26:29,831 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:26:29,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:26:29,831 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:26:29,831 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:26:29,831 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:26:29,831 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:26:29,831 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 422ea435de955cc6e58e578076c5ef733a2456157ad413df035d109cb231427a [2025-01-10 01:26:30,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:26:30,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:26:30,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:26:30,077 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:26:30,078 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:26:30,078 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NestedRecursion_2b.c [2025-01-10 01:26:31,254 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ba83c0a3b/734bcf3166074b4cb4dd6b44fb5ae60d/FLAGf766c3b41 [2025-01-10 01:26:31,477 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:26:31,478 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_2b.c [2025-01-10 01:26:31,486 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ba83c0a3b/734bcf3166074b4cb4dd6b44fb5ae60d/FLAGf766c3b41 [2025-01-10 01:26:31,830 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ba83c0a3b/734bcf3166074b4cb4dd6b44fb5ae60d [2025-01-10 01:26:31,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:26:31,834 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:26:31,835 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:26:31,835 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:26:31,838 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:26:31,838 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:26:31" (1/1) ... [2025-01-10 01:26:31,839 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@346f7de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:26:31, skipping insertion in model container [2025-01-10 01:26:31,839 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:26:31" (1/1) ... [2025-01-10 01:26:31,848 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:26:31,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:26:31,975 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:26:31,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:26:32,014 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:26:32,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:26:32 WrapperNode [2025-01-10 01:26:32,018 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:26:32,019 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:26:32,019 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:26:32,019 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:26:32,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:26:32" (1/1) ... [2025-01-10 01:26:32,034 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:26:32" (1/1) ... [2025-01-10 01:26:32,055 INFO L138 Inliner]: procedures = 5, calls = 5, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 12 [2025-01-10 01:26:32,056 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:26:32,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:26:32,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:26:32,060 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:26:32,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:26:32" (1/1) ... [2025-01-10 01:26:32,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:26:32" (1/1) ... [2025-01-10 01:26:32,070 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:26:32" (1/1) ... [2025-01-10 01:26:32,079 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 01:26:32,082 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:26:32" (1/1) ... [2025-01-10 01:26:32,083 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:26:32" (1/1) ... [2025-01-10 01:26:32,084 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:26:32" (1/1) ... [2025-01-10 01:26:32,084 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:26:32" (1/1) ... [2025-01-10 01:26:32,087 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:26:32" (1/1) ... [2025-01-10 01:26:32,087 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:26:32" (1/1) ... [2025-01-10 01:26:32,088 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:26:32" (1/1) ... [2025-01-10 01:26:32,089 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:26:32,090 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:26:32,090 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:26:32,090 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:26:32,091 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:26:32" (1/1) ... [2025-01-10 01:26:32,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:26:32,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:26:32,123 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:26:32,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:26:32,146 INFO L130 BoogieDeclarations]: Found specification of procedure g [2025-01-10 01:26:32,146 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2025-01-10 01:26:32,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:26:32,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:26:32,178 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:26:32,179 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:26:32,237 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-10 01:26:32,237 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:26:32,243 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:26:32,243 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:26:32,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:26:32 BoogieIcfgContainer [2025-01-10 01:26:32,244 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:26:32,245 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:26:32,245 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:26:32,248 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:26:32,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:26:31" (1/3) ... [2025-01-10 01:26:32,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@307708a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:26:32, skipping insertion in model container [2025-01-10 01:26:32,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:26:32" (2/3) ... [2025-01-10 01:26:32,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@307708a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:26:32, skipping insertion in model container [2025-01-10 01:26:32,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:26:32" (3/3) ... [2025-01-10 01:26:32,250 INFO L128 eAbstractionObserver]: Analyzing ICFG NestedRecursion_2b.c [2025-01-10 01:26:32,262 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:26:32,263 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG NestedRecursion_2b.c that has 2 procedures, 24 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-01-10 01:26:32,303 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:26:32,313 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;@3167b128, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:26:32,314 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-10 01:26:32,317 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:26:32,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:26:32,321 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:26:32,322 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:26:32,322 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-01-10 01:26:32,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:26:32,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1134721268, now seen corresponding path program 1 times [2025-01-10 01:26:32,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:26:32,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193367838] [2025-01-10 01:26:32,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:26:32,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:26:32,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:26:32,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:26:32,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:26:32,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:32,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:26:32,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:26:32,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193367838] [2025-01-10 01:26:32,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193367838] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:26:32,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:26:32,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:26:32,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798011555] [2025-01-10 01:26:32,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:26:32,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:26:32,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:26:32,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:26:32,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:26:32,545 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 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 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-01-10 01:26:32,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:26:32,652 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2025-01-10 01:26:32,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:26:32,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 7 [2025-01-10 01:26:32,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:26:32,659 INFO L225 Difference]: With dead ends: 43 [2025-01-10 01:26:32,659 INFO L226 Difference]: Without dead ends: 32 [2025-01-10 01:26:32,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:26:32,664 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:26:32,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 77 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:26:32,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-01-10 01:26:32,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2025-01-10 01:26:32,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 23 states have internal predecessors, (27), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:26:32,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2025-01-10 01:26:32,707 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 7 [2025-01-10 01:26:32,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:26:32,707 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-01-10 01:26:32,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-01-10 01:26:32,708 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2025-01-10 01:26:32,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:26:32,709 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:26:32,709 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:26:32,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:26:32,712 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-01-10 01:26:32,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:26:32,712 INFO L85 PathProgramCache]: Analyzing trace with hash 816620978, now seen corresponding path program 1 times [2025-01-10 01:26:32,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:26:32,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369896027] [2025-01-10 01:26:32,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:26:32,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:26:32,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:26:32,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:26:32,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:26:32,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:32,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:26:32,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:26:32,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369896027] [2025-01-10 01:26:32,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369896027] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:26:32,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:26:32,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:26:32,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972224608] [2025-01-10 01:26:32,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:26:32,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:26:32,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:26:32,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:26:32,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:26:32,796 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-01-10 01:26:32,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:26:32,858 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2025-01-10 01:26:32,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:26:32,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 8 [2025-01-10 01:26:32,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:26:32,865 INFO L225 Difference]: With dead ends: 47 [2025-01-10 01:26:32,869 INFO L226 Difference]: Without dead ends: 46 [2025-01-10 01:26:32,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:26:32,870 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 21 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:26:32,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 56 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:26:32,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-01-10 01:26:32,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2025-01-10 01:26:32,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 32 states have internal predecessors, (39), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 01:26:32,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2025-01-10 01:26:32,881 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 8 [2025-01-10 01:26:32,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:26:32,881 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2025-01-10 01:26:32,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-01-10 01:26:32,881 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2025-01-10 01:26:32,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 01:26:32,882 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:26:32,882 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:26:32,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:26:32,882 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-01-10 01:26:32,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:26:32,882 INFO L85 PathProgramCache]: Analyzing trace with hash 431664181, now seen corresponding path program 1 times [2025-01-10 01:26:32,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:26:32,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011063284] [2025-01-10 01:26:32,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:26:32,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:26:32,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:26:32,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:26:32,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:26:32,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:32,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:26:32,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:26:32,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011063284] [2025-01-10 01:26:32,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011063284] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:26:32,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818032602] [2025-01-10 01:26:32,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:26:32,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:26:32,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:26:32,954 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:26:32,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:26:32,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:26:32,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:26:32,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:26:32,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:32,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:26:32,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:26:33,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:26:33,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:26:33,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:26:33,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818032602] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:26:33,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:26:33,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-01-10 01:26:33,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877208255] [2025-01-10 01:26:33,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:26:33,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:26:33,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:26:33,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:26:33,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:26:33,071 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 12 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:26:33,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:26:33,199 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2025-01-10 01:26:33,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:26:33,199 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-10 01:26:33,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:26:33,200 INFO L225 Difference]: With dead ends: 96 [2025-01-10 01:26:33,201 INFO L226 Difference]: Without dead ends: 95 [2025-01-10 01:26:33,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:26:33,201 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 123 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:26:33,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 132 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:26:33,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-01-10 01:26:33,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 77. [2025-01-10 01:26:33,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 59 states have internal predecessors, (75), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 01:26:33,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 99 transitions. [2025-01-10 01:26:33,212 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 99 transitions. Word has length 12 [2025-01-10 01:26:33,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:26:33,213 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 99 transitions. [2025-01-10 01:26:33,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:26:33,213 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 99 transitions. [2025-01-10 01:26:33,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 01:26:33,213 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:26:33,213 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:26:33,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:26:33,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:26:33,416 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-01-10 01:26:33,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:26:33,418 INFO L85 PathProgramCache]: Analyzing trace with hash 574996991, now seen corresponding path program 1 times [2025-01-10 01:26:33,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:26:33,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897550960] [2025-01-10 01:26:33,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:26:33,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:26:33,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:26:33,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:26:33,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:26:33,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:33,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:26:33,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:26:33,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897550960] [2025-01-10 01:26:33,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897550960] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:26:33,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:26:33,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:26:33,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271280670] [2025-01-10 01:26:33,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:26:33,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:26:33,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:26:33,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:26:33,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:26:33,478 INFO L87 Difference]: Start difference. First operand 77 states and 99 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:26:33,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:26:33,491 INFO L93 Difference]: Finished difference Result 77 states and 99 transitions. [2025-01-10 01:26:33,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:26:33,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-01-10 01:26:33,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:26:33,493 INFO L225 Difference]: With dead ends: 77 [2025-01-10 01:26:33,493 INFO L226 Difference]: Without dead ends: 76 [2025-01-10 01:26:33,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:26:33,494 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:26:33,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 33 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:26:33,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-01-10 01:26:33,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-01-10 01:26:33,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 58 states have internal predecessors, (69), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 01:26:33,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2025-01-10 01:26:33,503 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 15 [2025-01-10 01:26:33,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:26:33,503 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2025-01-10 01:26:33,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:26:33,503 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2025-01-10 01:26:33,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 01:26:33,504 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:26:33,504 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:26:33,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:26:33,504 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-01-10 01:26:33,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:26:33,505 INFO L85 PathProgramCache]: Analyzing trace with hash 645037581, now seen corresponding path program 1 times [2025-01-10 01:26:33,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:26:33,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429985541] [2025-01-10 01:26:33,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:26:33,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:26:33,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:26:33,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:26:33,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:26:33,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:33,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:26:33,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:26:33,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429985541] [2025-01-10 01:26:33,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429985541] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:26:33,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:26:33,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:26:33,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357887687] [2025-01-10 01:26:33,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:26:33,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:26:33,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:26:33,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:26:33,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:26:33,533 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:26:33,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:26:33,571 INFO L93 Difference]: Finished difference Result 116 states and 154 transitions. [2025-01-10 01:26:33,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:26:33,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-01-10 01:26:33,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:26:33,573 INFO L225 Difference]: With dead ends: 116 [2025-01-10 01:26:33,573 INFO L226 Difference]: Without dead ends: 115 [2025-01-10 01:26:33,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:26:33,574 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 50 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-01-10 01:26:33,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 50 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:26:33,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-01-10 01:26:33,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 104. [2025-01-10 01:26:33,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 80 states have internal predecessors, (92), 13 states have call successors, (13), 6 states have call predecessors, (13), 10 states have return successors, (22), 17 states have call predecessors, (22), 11 states have call successors, (22) [2025-01-10 01:26:33,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 127 transitions. [2025-01-10 01:26:33,585 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 127 transitions. Word has length 16 [2025-01-10 01:26:33,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:26:33,586 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 127 transitions. [2025-01-10 01:26:33,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:26:33,586 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 127 transitions. [2025-01-10 01:26:33,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-10 01:26:33,586 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:26:33,586 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:26:33,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:26:33,587 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-01-10 01:26:33,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:26:33,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1915238450, now seen corresponding path program 1 times [2025-01-10 01:26:33,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:26:33,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920616816] [2025-01-10 01:26:33,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:26:33,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:26:33,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:26:33,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:26:33,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:26:33,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:33,631 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:26:33,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:26:33,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920616816] [2025-01-10 01:26:33,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920616816] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:26:33,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:26:33,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:26:33,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41746041] [2025-01-10 01:26:33,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:26:33,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:26:33,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:26:33,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:26:33,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:26:33,633 INFO L87 Difference]: Start difference. First operand 104 states and 127 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:26:33,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:26:33,683 INFO L93 Difference]: Finished difference Result 132 states and 173 transitions. [2025-01-10 01:26:33,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:26:33,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-01-10 01:26:33,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:26:33,684 INFO L225 Difference]: With dead ends: 132 [2025-01-10 01:26:33,684 INFO L226 Difference]: Without dead ends: 80 [2025-01-10 01:26:33,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:26:33,685 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 13 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:26:33,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 62 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:26:33,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-01-10 01:26:33,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 51. [2025-01-10 01:26:33,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 42 states have internal predecessors, (45), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 1 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 01:26:33,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2025-01-10 01:26:33,692 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 20 [2025-01-10 01:26:33,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:26:33,692 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2025-01-10 01:26:33,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:26:33,692 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2025-01-10 01:26:33,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 01:26:33,692 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:26:33,693 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:26:33,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:26:33,693 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-01-10 01:26:33,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:26:33,693 INFO L85 PathProgramCache]: Analyzing trace with hash 757150232, now seen corresponding path program 1 times [2025-01-10 01:26:33,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:26:33,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309742601] [2025-01-10 01:26:33,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:26:33,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:26:33,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:26:33,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:26:33,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:26:33,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:33,739 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:26:33,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:26:33,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309742601] [2025-01-10 01:26:33,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309742601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:26:33,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:26:33,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:26:33,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465626027] [2025-01-10 01:26:33,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:26:33,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:26:33,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:26:33,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:26:33,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:26:33,741 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:26:33,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:26:33,791 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2025-01-10 01:26:33,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:26:33,791 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-01-10 01:26:33,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:26:33,792 INFO L225 Difference]: With dead ends: 56 [2025-01-10 01:26:33,792 INFO L226 Difference]: Without dead ends: 55 [2025-01-10 01:26:33,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:26:33,793 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 14 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:26:33,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 59 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:26:33,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-01-10 01:26:33,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2025-01-10 01:26:33,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 34 states have internal predecessors, (36), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:26:33,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2025-01-10 01:26:33,798 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 21 [2025-01-10 01:26:33,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:26:33,799 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2025-01-10 01:26:33,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:26:33,799 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2025-01-10 01:26:33,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 01:26:33,799 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:26:33,799 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:26:33,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:26:33,800 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-01-10 01:26:33,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:26:33,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1990628763, now seen corresponding path program 2 times [2025-01-10 01:26:33,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:26:33,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329030793] [2025-01-10 01:26:33,800 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:26:33,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:26:33,804 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-10 01:26:33,807 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:26:33,808 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:26:33,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:33,865 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:26:33,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:26:33,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329030793] [2025-01-10 01:26:33,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329030793] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:26:33,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824729533] [2025-01-10 01:26:33,866 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:26:33,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:26:33,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:26:33,868 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:26:33,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:26:33,885 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-10 01:26:33,891 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:26:33,891 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:26:33,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:33,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:26:33,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:26:33,912 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:26:33,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:26:33,990 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:26:33,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824729533] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:26:33,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:26:33,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-10 01:26:33,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997194101] [2025-01-10 01:26:33,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:26:33,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:26:33,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:26:33,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:26:33,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:26:33,992 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 10 states have internal predecessors, (31), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:26:34,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:26:34,162 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2025-01-10 01:26:34,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-10 01:26:34,163 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 10 states have internal predecessors, (31), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2025-01-10 01:26:34,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:26:34,163 INFO L225 Difference]: With dead ends: 91 [2025-01-10 01:26:34,164 INFO L226 Difference]: Without dead ends: 76 [2025-01-10 01:26:34,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2025-01-10 01:26:34,164 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 55 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:26:34,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 98 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:26:34,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-01-10 01:26:34,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 47. [2025-01-10 01:26:34,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 38 states have internal predecessors, (40), 7 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (4), 1 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:26:34,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2025-01-10 01:26:34,171 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 25 [2025-01-10 01:26:34,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:26:34,171 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2025-01-10 01:26:34,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 10 states have internal predecessors, (31), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:26:34,171 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2025-01-10 01:26:34,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-10 01:26:34,172 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:26:34,172 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2025-01-10 01:26:34,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:26:34,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:26:34,372 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-01-10 01:26:34,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:26:34,373 INFO L85 PathProgramCache]: Analyzing trace with hash -895487436, now seen corresponding path program 2 times [2025-01-10 01:26:34,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:26:34,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720317965] [2025-01-10 01:26:34,373 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:26:34,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:26:34,376 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-10 01:26:34,380 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 01:26:34,380 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:26:34,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:34,523 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:26:34,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:26:34,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720317965] [2025-01-10 01:26:34,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720317965] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:26:34,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083656240] [2025-01-10 01:26:34,525 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:26:34,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:26:34,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:26:34,529 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:26:34,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:26:34,555 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-10 01:26:34,566 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 01:26:34,567 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:26:34,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:34,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:26:34,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:26:34,615 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:26:34,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:26:34,774 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:26:34,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083656240] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:26:34,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:26:34,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-01-10 01:26:34,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243123621] [2025-01-10 01:26:34,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:26:34,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 01:26:34,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:26:34,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 01:26:34,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2025-01-10 01:26:34,778 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 24 states, 21 states have (on average 2.0) internal successors, (42), 14 states have internal predecessors, (42), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:26:35,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:26:35,018 INFO L93 Difference]: Finished difference Result 147 states and 165 transitions. [2025-01-10 01:26:35,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 01:26:35,018 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.0) internal successors, (42), 14 states have internal predecessors, (42), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-01-10 01:26:35,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:26:35,019 INFO L225 Difference]: With dead ends: 147 [2025-01-10 01:26:35,019 INFO L226 Difference]: Without dead ends: 146 [2025-01-10 01:26:35,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=311, Invalid=811, Unknown=0, NotChecked=0, Total=1122 [2025-01-10 01:26:35,020 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 210 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:26:35,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 161 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:26:35,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-01-10 01:26:35,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 89. [2025-01-10 01:26:35,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 74 states have internal predecessors, (76), 13 states have call successors, (13), 13 states have call predecessors, (13), 10 states have return successors, (10), 1 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 01:26:35,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2025-01-10 01:26:35,031 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 27 [2025-01-10 01:26:35,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:26:35,032 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2025-01-10 01:26:35,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.0) internal successors, (42), 14 states have internal predecessors, (42), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:26:35,032 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2025-01-10 01:26:35,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-10 01:26:35,033 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:26:35,033 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:26:35,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:26:35,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:26:35,237 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-01-10 01:26:35,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:26:35,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1029918734, now seen corresponding path program 3 times [2025-01-10 01:26:35,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:26:35,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447924119] [2025-01-10 01:26:35,238 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:26:35,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:26:35,242 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 7 equivalence classes. [2025-01-10 01:26:35,248 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 01:26:35,249 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-01-10 01:26:35,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:35,385 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:26:35,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:26:35,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447924119] [2025-01-10 01:26:35,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447924119] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:26:35,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948776811] [2025-01-10 01:26:35,386 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:26:35,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:26:35,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:26:35,388 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:26:35,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 01:26:35,408 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 7 equivalence classes. [2025-01-10 01:26:35,416 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 01:26:35,417 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-01-10 01:26:35,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:35,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 01:26:35,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:26:35,452 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:26:35,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:26:35,622 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:26:35,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948776811] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:26:35,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:26:35,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-01-10 01:26:35,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259508617] [2025-01-10 01:26:35,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:26:35,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 01:26:35,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:26:35,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 01:26:35,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2025-01-10 01:26:35,625 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 16 states have internal predecessors, (55), 11 states have call successors, (12), 11 states have call predecessors, (12), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:26:35,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:26:35,764 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2025-01-10 01:26:35,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 01:26:35,764 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 16 states have internal predecessors, (55), 11 states have call successors, (12), 11 states have call predecessors, (12), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2025-01-10 01:26:35,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:26:35,765 INFO L225 Difference]: With dead ends: 120 [2025-01-10 01:26:35,765 INFO L226 Difference]: Without dead ends: 58 [2025-01-10 01:26:35,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=294, Invalid=828, Unknown=0, NotChecked=0, Total=1122 [2025-01-10 01:26:35,766 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 66 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:26:35,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 122 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:26:35,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-01-10 01:26:35,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-01-10 01:26:35,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 11 states have call successors, (11), 11 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:26:35,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2025-01-10 01:26:35,771 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 40 [2025-01-10 01:26:35,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:26:35,771 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2025-01-10 01:26:35,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 16 states have internal predecessors, (55), 11 states have call successors, (12), 11 states have call predecessors, (12), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:26:35,771 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2025-01-10 01:26:35,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-10 01:26:35,772 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:26:35,772 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1] [2025-01-10 01:26:35,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 01:26:35,977 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,SelfDestructingSolverStorable9 [2025-01-10 01:26:35,977 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-01-10 01:26:35,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:26:35,978 INFO L85 PathProgramCache]: Analyzing trace with hash -130937836, now seen corresponding path program 3 times [2025-01-10 01:26:35,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:26:35,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267883598] [2025-01-10 01:26:35,978 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:26:35,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:26:35,982 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 57 statements into 11 equivalence classes. [2025-01-10 01:26:35,990 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 57 of 57 statements. [2025-01-10 01:26:35,990 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 01:26:35,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:36,288 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:26:36,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:26:36,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267883598] [2025-01-10 01:26:36,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267883598] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:26:36,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141265206] [2025-01-10 01:26:36,289 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:26:36,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:26:36,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:26:36,291 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:26:36,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 01:26:36,313 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 57 statements into 11 equivalence classes. [2025-01-10 01:26:36,324 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 57 of 57 statements. [2025-01-10 01:26:36,324 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 01:26:36,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:36,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 01:26:36,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:26:36,384 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:26:36,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:26:36,831 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:26:36,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141265206] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:26:36,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:26:36,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-01-10 01:26:36,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391926389] [2025-01-10 01:26:36,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:26:36,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-01-10 01:26:36,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:26:36,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-01-10 01:26:36,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=1700, Unknown=0, NotChecked=0, Total=2256 [2025-01-10 01:26:36,833 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand has 48 states, 45 states have (on average 2.0) internal successors, (90), 26 states have internal predecessors, (90), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:26:37,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:26:37,277 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2025-01-10 01:26:37,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-01-10 01:26:37,277 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 2.0) internal successors, (90), 26 states have internal predecessors, (90), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-01-10 01:26:37,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:26:37,278 INFO L225 Difference]: With dead ends: 121 [2025-01-10 01:26:37,278 INFO L226 Difference]: Without dead ends: 120 [2025-01-10 01:26:37,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1337, Invalid=3493, Unknown=0, NotChecked=0, Total=4830 [2025-01-10 01:26:37,280 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 209 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:26:37,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 47 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:26:37,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-10 01:26:37,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2025-01-10 01:26:37,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 94 states have (on average 1.0106382978723405) internal successors, (95), 94 states have internal predecessors, (95), 23 states have call successors, (23), 23 states have call predecessors, (23), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:26:37,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2025-01-10 01:26:37,287 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 57 [2025-01-10 01:26:37,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:26:37,288 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2025-01-10 01:26:37,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 2.0) internal successors, (90), 26 states have internal predecessors, (90), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:26:37,288 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2025-01-10 01:26:37,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-10 01:26:37,289 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:26:37,289 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1, 1, 1] [2025-01-10 01:26:37,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 01:26:37,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-10 01:26:37,494 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-01-10 01:26:37,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:26:37,495 INFO L85 PathProgramCache]: Analyzing trace with hash 2074912724, now seen corresponding path program 4 times [2025-01-10 01:26:37,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:26:37,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684541989] [2025-01-10 01:26:37,495 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:26:37,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:26:37,499 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 117 statements into 2 equivalence classes. [2025-01-10 01:26:37,515 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 117 of 117 statements. [2025-01-10 01:26:37,515 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:26:37,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:38,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:26:38,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:26:38,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684541989] [2025-01-10 01:26:38,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684541989] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:26:38,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282492205] [2025-01-10 01:26:38,502 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:26:38,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:26:38,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:26:38,504 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:26:38,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 01:26:38,528 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 117 statements into 2 equivalence classes. [2025-01-10 01:26:38,547 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 117 of 117 statements. [2025-01-10 01:26:38,547 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:26:38,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:38,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-10 01:26:38,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:26:38,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:26:38,661 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:26:40,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:26:40,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282492205] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:26:40,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:26:40,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2025-01-10 01:26:40,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319399082] [2025-01-10 01:26:40,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:26:40,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-01-10 01:26:40,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:26:40,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-01-10 01:26:40,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2260, Invalid=6860, Unknown=0, NotChecked=0, Total=9120 [2025-01-10 01:26:40,399 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand has 96 states, 93 states have (on average 2.0) internal successors, (186), 50 states have internal predecessors, (186), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:26:41,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:26:41,971 INFO L93 Difference]: Finished difference Result 241 states and 264 transitions. [2025-01-10 01:26:41,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-01-10 01:26:41,975 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 93 states have (on average 2.0) internal successors, (186), 50 states have internal predecessors, (186), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2025-01-10 01:26:41,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:26:41,976 INFO L225 Difference]: With dead ends: 241 [2025-01-10 01:26:41,976 INFO L226 Difference]: Without dead ends: 240 [2025-01-10 01:26:41,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5549, Invalid=14473, Unknown=0, NotChecked=0, Total=20022 [2025-01-10 01:26:41,983 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 521 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 01:26:41,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 46 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 01:26:41,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-01-10 01:26:41,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 238. [2025-01-10 01:26:41,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 190 states have (on average 1.0052631578947369) internal successors, (191), 190 states have internal predecessors, (191), 47 states have call successors, (47), 47 states have call predecessors, (47), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:26:41,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2025-01-10 01:26:41,994 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 117 [2025-01-10 01:26:41,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:26:41,994 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 238 transitions. [2025-01-10 01:26:41,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 93 states have (on average 2.0) internal successors, (186), 50 states have internal predecessors, (186), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:26:41,994 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 238 transitions. [2025-01-10 01:26:41,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-01-10 01:26:41,996 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:26:41,996 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 1, 1, 1, 1, 1] [2025-01-10 01:26:42,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 01:26:42,201 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,SelfDestructingSolverStorable11 [2025-01-10 01:26:42,201 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-01-10 01:26:42,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:26:42,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1774419796, now seen corresponding path program 5 times [2025-01-10 01:26:42,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:26:42,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593233787] [2025-01-10 01:26:42,202 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:26:42,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:26:42,208 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 237 statements into 47 equivalence classes. [2025-01-10 01:26:42,308 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 237 of 237 statements. [2025-01-10 01:26:42,308 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-10 01:26:42,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:46,005 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:26:46,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:26:46,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593233787] [2025-01-10 01:26:46,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593233787] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:26:46,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127720650] [2025-01-10 01:26:46,005 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:26:46,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:26:46,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:26:46,008 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:26:46,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 01:26:46,034 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 237 statements into 47 equivalence classes. [2025-01-10 01:26:46,139 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 237 of 237 statements. [2025-01-10 01:26:46,139 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-10 01:26:46,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:46,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-01-10 01:26:46,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:26:46,427 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:26:46,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:26:52,258 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:26:52,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127720650] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:26:52,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:26:52,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2025-01-10 01:26:52,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565108745] [2025-01-10 01:26:52,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:26:52,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2025-01-10 01:26:52,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:26:52,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-01-10 01:26:52,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9124, Invalid=27548, Unknown=0, NotChecked=0, Total=36672 [2025-01-10 01:26:52,276 INFO L87 Difference]: Start difference. First operand 238 states and 238 transitions. Second operand has 192 states, 189 states have (on average 2.0) internal successors, (378), 98 states have internal predecessors, (378), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:26:58,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:26:58,009 INFO L93 Difference]: Finished difference Result 481 states and 528 transitions. [2025-01-10 01:26:58,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-01-10 01:26:58,010 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 189 states have (on average 2.0) internal successors, (378), 98 states have internal predecessors, (378), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 237 [2025-01-10 01:26:58,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:26:58,014 INFO L225 Difference]: With dead ends: 481 [2025-01-10 01:26:58,014 INFO L226 Difference]: Without dead ends: 480 [2025-01-10 01:26:58,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 662 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17484 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=22613, Invalid=58897, Unknown=0, NotChecked=0, Total=81510 [2025-01-10 01:26:58,026 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 1213 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1213 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 01:26:58,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1213 Valid, 62 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 01:26:58,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-01-10 01:26:58,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 478. [2025-01-10 01:26:58,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 382 states have (on average 1.0026178010471205) internal successors, (383), 382 states have internal predecessors, (383), 95 states have call successors, (95), 95 states have call predecessors, (95), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:26:58,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 478 transitions. [2025-01-10 01:26:58,083 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 478 transitions. Word has length 237 [2025-01-10 01:26:58,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:26:58,084 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 478 transitions. [2025-01-10 01:26:58,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 189 states have (on average 2.0) internal successors, (378), 98 states have internal predecessors, (378), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:26:58,085 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 478 transitions. [2025-01-10 01:26:58,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-01-10 01:26:58,093 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:26:58,093 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 94, 94, 94, 1, 1, 1, 1, 1] [2025-01-10 01:26:58,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 01:26:58,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:26:58,294 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-01-10 01:26:58,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:26:58,294 INFO L85 PathProgramCache]: Analyzing trace with hash 750235220, now seen corresponding path program 6 times [2025-01-10 01:26:58,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:26:58,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926369551] [2025-01-10 01:26:58,295 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:26:58,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:26:58,304 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 477 statements into 95 equivalence classes. [2025-01-10 01:26:58,456 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 477 of 477 statements. [2025-01-10 01:26:58,456 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-01-10 01:26:58,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:27:12,625 INFO L134 CoverageAnalysis]: Checked inductivity of 22137 backedges. 0 proven. 22137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:27:12,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:27:12,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926369551] [2025-01-10 01:27:12,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926369551] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:27:12,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742138233] [2025-01-10 01:27:12,626 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:27:12,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:27:12,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:27:12,627 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:27:12,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 01:27:12,674 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 477 statements into 95 equivalence classes. [2025-01-10 01:27:13,030 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 477 of 477 statements. [2025-01-10 01:27:13,031 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-01-10 01:27:13,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:27:13,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 860 conjuncts, 192 conjuncts are in the unsatisfiable core [2025-01-10 01:27:13,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:27:13,501 INFO L134 CoverageAnalysis]: Checked inductivity of 22137 backedges. 0 proven. 22137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:27:13,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:27:38,364 INFO L134 CoverageAnalysis]: Checked inductivity of 22137 backedges. 0 proven. 22137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:27:38,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742138233] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:27:38,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:27:38,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [192, 192, 192] total 383 [2025-01-10 01:27:38,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439600742] [2025-01-10 01:27:38,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:27:38,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 384 states [2025-01-10 01:27:38,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:27:38,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 384 interpolants. [2025-01-10 01:27:38,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36676, Invalid=110396, Unknown=0, NotChecked=0, Total=147072 [2025-01-10 01:27:38,380 INFO L87 Difference]: Start difference. First operand 478 states and 478 transitions. Second operand has 384 states, 381 states have (on average 2.0) internal successors, (762), 194 states have internal predecessors, (762), 190 states have call successors, (190), 190 states have call predecessors, (190), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:28:10,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:28:10,867 INFO L93 Difference]: Finished difference Result 961 states and 1056 transitions. [2025-01-10 01:28:10,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 384 states. [2025-01-10 01:28:10,868 INFO L78 Accepts]: Start accepts. Automaton has has 384 states, 381 states have (on average 2.0) internal successors, (762), 194 states have internal predecessors, (762), 190 states have call successors, (190), 190 states have call predecessors, (190), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 477 [2025-01-10 01:28:10,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:28:10,874 INFO L225 Difference]: With dead ends: 961 [2025-01-10 01:28:10,875 INFO L226 Difference]: Without dead ends: 960 [2025-01-10 01:28:10,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1334 GetRequests, 762 SyntacticMatches, 0 SemanticMatches, 572 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71820 ImplicationChecksByTransitivity, 49.4s TimeCoverageRelationStatistics Valid=91301, Invalid=237601, Unknown=0, NotChecked=0, Total=328902 [2025-01-10 01:28:10,893 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 3557 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1730 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3557 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 1732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:28:10,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3557 Valid, 55 Invalid, 1732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1730 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-10 01:28:10,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2025-01-10 01:28:10,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 958. [2025-01-10 01:28:10,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 766 states have (on average 1.0013054830287207) internal successors, (767), 766 states have internal predecessors, (767), 191 states have call successors, (191), 191 states have call predecessors, (191), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:28:10,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 958 transitions. [2025-01-10 01:28:10,997 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 958 transitions. Word has length 477 [2025-01-10 01:28:10,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:28:10,997 INFO L471 AbstractCegarLoop]: Abstraction has 958 states and 958 transitions. [2025-01-10 01:28:10,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 384 states, 381 states have (on average 2.0) internal successors, (762), 194 states have internal predecessors, (762), 190 states have call successors, (190), 190 states have call predecessors, (190), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:28:10,998 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 958 transitions. [2025-01-10 01:28:11,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 958 [2025-01-10 01:28:11,014 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:28:11,014 INFO L218 NwaCegarLoop]: trace histogram [191, 191, 190, 190, 190, 1, 1, 1, 1, 1] [2025-01-10 01:28:11,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 01:28:11,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:28:11,218 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-01-10 01:28:11,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:28:11,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1606028372, now seen corresponding path program 7 times [2025-01-10 01:28:11,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:28:11,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620622583] [2025-01-10 01:28:11,219 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:28:11,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:28:11,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 957 statements into 1 equivalence classes. [2025-01-10 01:28:11,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 957 of 957 statements. [2025-01-10 01:28:11,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:28:11,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat