./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/HenzingerJhalaMajumdarSutre-POPL2002-LockingExample.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-lit/HenzingerJhalaMajumdarSutre-POPL2002-LockingExample.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 b7e15211580ea4e53f751b22847dfea4720c9dc42574c861d991d991eb47919b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:30:18,010 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:30:18,064 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:30:18,070 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:30:18,070 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:30:18,085 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:30:18,086 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:30:18,086 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:30:18,086 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:30:18,086 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:30:18,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:30:18,086 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:30:18,086 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:30:18,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:30:18,087 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:30:18,087 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:30:18,087 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:30:18,087 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:30:18,087 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:30:18,087 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:30:18,087 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:30:18,087 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:30:18,087 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:30:18,087 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:30:18,088 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:30:18,088 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:30:18,088 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:30:18,088 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:30:18,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:30:18,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:30:18,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:30:18,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:30:18,088 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:30:18,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:30:18,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:30:18,089 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:30:18,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:30:18,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:30:18,089 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:30:18,089 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:30:18,089 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:30:18,089 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:30:18,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:30:18,089 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:30:18,089 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:30:18,089 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:30:18,089 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:30:18,090 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 -> b7e15211580ea4e53f751b22847dfea4720c9dc42574c861d991d991eb47919b [2025-01-10 01:30:18,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:30:18,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:30:18,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:30:18,337 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:30:18,337 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:30:18,338 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/HenzingerJhalaMajumdarSutre-POPL2002-LockingExample.c [2025-01-10 01:30:19,535 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ba2fae2f/d570c88f4d344fa287223280eb6410d3/FLAGc846cee0f [2025-01-10 01:30:19,764 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:30:19,764 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/HenzingerJhalaMajumdarSutre-POPL2002-LockingExample.c [2025-01-10 01:30:19,771 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ba2fae2f/d570c88f4d344fa287223280eb6410d3/FLAGc846cee0f [2025-01-10 01:30:20,120 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ba2fae2f/d570c88f4d344fa287223280eb6410d3 [2025-01-10 01:30:20,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:30:20,125 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:30:20,126 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:30:20,126 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:30:20,131 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:30:20,132 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:30:20" (1/1) ... [2025-01-10 01:30:20,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50f09679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:20, skipping insertion in model container [2025-01-10 01:30:20,133 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:30:20" (1/1) ... [2025-01-10 01:30:20,147 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:30:20,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:30:20,265 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:30:20,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:30:20,287 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:30:20,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:20 WrapperNode [2025-01-10 01:30:20,289 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:30:20,290 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:30:20,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:30:20,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:30:20,295 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:30:20" (1/1) ... [2025-01-10 01:30:20,298 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:30:20" (1/1) ... [2025-01-10 01:30:20,309 INFO L138 Inliner]: procedures = 6, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 51 [2025-01-10 01:30:20,310 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:30:20,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:30:20,311 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:30:20,311 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:30:20,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:20" (1/1) ... [2025-01-10 01:30:20,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:20" (1/1) ... [2025-01-10 01:30:20,317 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:20" (1/1) ... [2025-01-10 01:30:20,324 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 01:30:20,324 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:20" (1/1) ... [2025-01-10 01:30:20,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:20" (1/1) ... [2025-01-10 01:30:20,325 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:20" (1/1) ... [2025-01-10 01:30:20,326 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:20" (1/1) ... [2025-01-10 01:30:20,334 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:20" (1/1) ... [2025-01-10 01:30:20,334 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:20" (1/1) ... [2025-01-10 01:30:20,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:20" (1/1) ... [2025-01-10 01:30:20,336 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:30:20,340 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:30:20,340 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:30:20,340 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:30:20,341 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:20" (1/1) ... [2025-01-10 01:30:20,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:30:20,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:30:20,389 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:30:20,392 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:30:20,422 INFO L130 BoogieDeclarations]: Found specification of procedure unlock [2025-01-10 01:30:20,422 INFO L138 BoogieDeclarations]: Found implementation of procedure unlock [2025-01-10 01:30:20,422 INFO L130 BoogieDeclarations]: Found specification of procedure lock [2025-01-10 01:30:20,422 INFO L138 BoogieDeclarations]: Found implementation of procedure lock [2025-01-10 01:30:20,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:30:20,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:30:20,477 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:30:20,480 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:30:20,695 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-10 01:30:20,696 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:30:20,706 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:30:20,706 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 01:30:20,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:30:20 BoogieIcfgContainer [2025-01-10 01:30:20,707 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:30:20,708 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:30:20,708 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:30:20,712 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:30:20,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:30:20" (1/3) ... [2025-01-10 01:30:20,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ae14d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:30:20, skipping insertion in model container [2025-01-10 01:30:20,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:20" (2/3) ... [2025-01-10 01:30:20,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ae14d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:30:20, skipping insertion in model container [2025-01-10 01:30:20,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:30:20" (3/3) ... [2025-01-10 01:30:20,715 INFO L128 eAbstractionObserver]: Analyzing ICFG HenzingerJhalaMajumdarSutre-POPL2002-LockingExample.c [2025-01-10 01:30:20,726 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:30:20,729 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG HenzingerJhalaMajumdarSutre-POPL2002-LockingExample.c that has 3 procedures, 36 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-01-10 01:30:20,771 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:30:20,786 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;@27662386, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:30:20,786 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-10 01:30:20,792 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 25 states have (on average 1.52) internal successors, (38), 29 states have internal predecessors, (38), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 01:30:20,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 01:30:20,795 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:20,796 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:30:20,797 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:30:20,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:20,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1178430607, now seen corresponding path program 1 times [2025-01-10 01:30:20,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:20,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885224732] [2025-01-10 01:30:20,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:20,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:20,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:30:20,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:30:20,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:20,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:21,037 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:30:21,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:21,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885224732] [2025-01-10 01:30:21,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885224732] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:30:21,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:30:21,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:30:21,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043993450] [2025-01-10 01:30:21,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:30:21,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:30:21,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:21,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:30:21,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:30:21,083 INFO L87 Difference]: Start difference. First operand has 36 states, 25 states have (on average 1.52) internal successors, (38), 29 states have internal predecessors, (38), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:30:21,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:21,167 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2025-01-10 01:30:21,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:30:21,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-01-10 01:30:21,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:21,182 INFO L225 Difference]: With dead ends: 57 [2025-01-10 01:30:21,182 INFO L226 Difference]: Without dead ends: 30 [2025-01-10 01:30:21,184 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:30:21,190 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:21,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 109 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:30:21,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-01-10 01:30:21,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-01-10 01:30:21,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 24 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:30:21,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2025-01-10 01:30:21,248 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 11 [2025-01-10 01:30:21,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:21,250 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2025-01-10 01:30:21,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:30:21,251 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2025-01-10 01:30:21,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 01:30:21,252 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:21,253 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:30:21,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:30:21,253 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:30:21,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:21,257 INFO L85 PathProgramCache]: Analyzing trace with hash 2123356909, now seen corresponding path program 1 times [2025-01-10 01:30:21,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:21,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050484049] [2025-01-10 01:30:21,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:21,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:21,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:30:21,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:30:21,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:21,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:21,292 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:30:21,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:21,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050484049] [2025-01-10 01:30:21,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050484049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:30:21,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:30:21,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:30:21,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802859543] [2025-01-10 01:30:21,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:30:21,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:30:21,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:21,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:30:21,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:30:21,296 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:30:21,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:21,316 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2025-01-10 01:30:21,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:30:21,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-01-10 01:30:21,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:21,317 INFO L225 Difference]: With dead ends: 31 [2025-01-10 01:30:21,317 INFO L226 Difference]: Without dead ends: 30 [2025-01-10 01:30:21,317 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:30:21,318 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:21,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 93 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:30:21,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-01-10 01:30:21,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2025-01-10 01:30:21,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:30:21,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2025-01-10 01:30:21,321 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 12 [2025-01-10 01:30:21,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:21,321 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2025-01-10 01:30:21,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:30:21,322 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2025-01-10 01:30:21,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 01:30:21,322 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:21,322 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:30:21,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:30:21,322 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:30:21,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:21,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1553719471, now seen corresponding path program 1 times [2025-01-10 01:30:21,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:21,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662622017] [2025-01-10 01:30:21,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:21,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:21,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:30:21,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:30:21,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:21,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:21,364 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:30:21,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:21,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662622017] [2025-01-10 01:30:21,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662622017] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:30:21,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:30:21,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:30:21,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247452391] [2025-01-10 01:30:21,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:30:21,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:30:21,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:21,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:30:21,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:30:21,366 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:30:21,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:21,382 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2025-01-10 01:30:21,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:30:21,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2025-01-10 01:30:21,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:21,383 INFO L225 Difference]: With dead ends: 29 [2025-01-10 01:30:21,383 INFO L226 Difference]: Without dead ends: 28 [2025-01-10 01:30:21,383 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:30:21,384 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 15 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:21,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 72 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:30:21,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-10 01:30:21,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-01-10 01:30:21,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:30:21,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2025-01-10 01:30:21,387 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 15 [2025-01-10 01:30:21,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:21,388 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2025-01-10 01:30:21,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:30:21,388 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2025-01-10 01:30:21,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 01:30:21,388 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:21,388 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:30:21,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:30:21,389 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:30:21,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:21,389 INFO L85 PathProgramCache]: Analyzing trace with hash -920663247, now seen corresponding path program 1 times [2025-01-10 01:30:21,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:21,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670469067] [2025-01-10 01:30:21,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:21,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:21,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:30:21,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:30:21,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:21,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:21,426 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:30:21,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:21,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670469067] [2025-01-10 01:30:21,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670469067] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:30:21,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:30:21,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:30:21,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47533785] [2025-01-10 01:30:21,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:30:21,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:30:21,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:21,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:30:21,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:30:21,427 INFO L87 Difference]: Start difference. First operand 28 states and 37 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, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:30:21,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:21,447 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2025-01-10 01:30:21,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:30:21,447 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, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2025-01-10 01:30:21,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:21,448 INFO L225 Difference]: With dead ends: 37 [2025-01-10 01:30:21,448 INFO L226 Difference]: Without dead ends: 36 [2025-01-10 01:30:21,448 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:30:21,449 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 14 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:21,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 78 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:30:21,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-01-10 01:30:21,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-01-10 01:30:21,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:30:21,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2025-01-10 01:30:21,453 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 16 [2025-01-10 01:30:21,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:21,454 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2025-01-10 01:30:21,454 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, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:30:21,454 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2025-01-10 01:30:21,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 01:30:21,454 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:21,454 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:30:21,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:30:21,455 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:30:21,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:21,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1693175028, now seen corresponding path program 1 times [2025-01-10 01:30:21,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:21,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391653547] [2025-01-10 01:30:21,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:21,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:21,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 01:30:21,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 01:30:21,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:21,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:21,523 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:30:21,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:21,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391653547] [2025-01-10 01:30:21,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391653547] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:30:21,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013967554] [2025-01-10 01:30:21,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:21,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:21,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:30:21,526 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:30:21,528 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:30:21,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 01:30:21,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 01:30:21,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:21,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:21,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:30:21,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:30:21,623 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:30:21,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:30:21,688 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:30:21,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013967554] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:30:21,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:30:21,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-01-10 01:30:21,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817279225] [2025-01-10 01:30:21,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:30:21,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:30:21,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:21,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:30:21,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:30:21,690 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-10 01:30:21,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:21,743 INFO L93 Difference]: Finished difference Result 61 states and 84 transitions. [2025-01-10 01:30:21,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:30:21,743 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 30 [2025-01-10 01:30:21,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:21,744 INFO L225 Difference]: With dead ends: 61 [2025-01-10 01:30:21,744 INFO L226 Difference]: Without dead ends: 60 [2025-01-10 01:30:21,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:30:21,745 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 32 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:21,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 126 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:30:21,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-10 01:30:21,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-01-10 01:30:21,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 46 states have internal predecessors, (57), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 01:30:21,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 81 transitions. [2025-01-10 01:30:21,751 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 81 transitions. Word has length 30 [2025-01-10 01:30:21,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:21,752 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 81 transitions. [2025-01-10 01:30:21,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-10 01:30:21,752 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 81 transitions. [2025-01-10 01:30:21,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-10 01:30:21,753 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:21,753 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1] [2025-01-10 01:30:21,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 01:30:21,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:21,954 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:30:21,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:21,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1144391453, now seen corresponding path program 2 times [2025-01-10 01:30:21,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:21,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800579310] [2025-01-10 01:30:21,959 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:30:21,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:21,971 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-01-10 01:30:21,981 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-01-10 01:30:21,981 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:30:21,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:22,276 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:30:22,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:22,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800579310] [2025-01-10 01:30:22,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800579310] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:30:22,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177502836] [2025-01-10 01:30:22,277 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:30:22,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:22,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:30:22,279 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:30:22,281 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:30:22,303 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-01-10 01:30:22,322 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-01-10 01:30:22,322 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:30:22,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:22,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 01:30:22,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:30:22,379 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:30:22,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:30:22,597 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:30:22,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177502836] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:30:22,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:30:22,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2025-01-10 01:30:22,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199679374] [2025-01-10 01:30:22,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:30:22,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 01:30:22,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:22,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 01:30:22,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-01-10 01:30:22,602 INFO L87 Difference]: Start difference. First operand 60 states and 81 transitions. Second operand has 22 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 22 states have internal predecessors, (67), 10 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 10 states have call predecessors, (20), 10 states have call successors, (20) [2025-01-10 01:30:22,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:22,720 INFO L93 Difference]: Finished difference Result 109 states and 153 transitions. [2025-01-10 01:30:22,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-10 01:30:22,720 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 22 states have internal predecessors, (67), 10 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 10 states have call predecessors, (20), 10 states have call successors, (20) Word has length 72 [2025-01-10 01:30:22,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:22,721 INFO L225 Difference]: With dead ends: 109 [2025-01-10 01:30:22,721 INFO L226 Difference]: Without dead ends: 108 [2025-01-10 01:30:22,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-01-10 01:30:22,722 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 62 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:22,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 150 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:30:22,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-10 01:30:22,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-01-10 01:30:22,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 81 states have (on average 1.2222222222222223) internal successors, (99), 82 states have internal predecessors, (99), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-10 01:30:22,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 147 transitions. [2025-01-10 01:30:22,740 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 147 transitions. Word has length 72 [2025-01-10 01:30:22,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:22,740 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 147 transitions. [2025-01-10 01:30:22,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 22 states have internal predecessors, (67), 10 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 10 states have call predecessors, (20), 10 states have call successors, (20) [2025-01-10 01:30:22,740 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 147 transitions. [2025-01-10 01:30:22,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-10 01:30:22,747 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:22,747 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 1, 1, 1, 1] [2025-01-10 01:30:22,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:30:22,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:22,948 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:30:22,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:22,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1523953793, now seen corresponding path program 3 times [2025-01-10 01:30:22,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:22,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942415872] [2025-01-10 01:30:22,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:30:22,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:22,966 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 156 statements into 11 equivalence classes. [2025-01-10 01:30:22,993 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 156 of 156 statements. [2025-01-10 01:30:22,995 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 01:30:22,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:23,725 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 430 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-01-10 01:30:23,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:23,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942415872] [2025-01-10 01:30:23,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942415872] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:30:23,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338221201] [2025-01-10 01:30:23,726 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:30:23,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:23,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:30:23,732 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:30:23,733 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:30:23,771 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 156 statements into 11 equivalence classes. [2025-01-10 01:30:23,818 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 156 of 156 statements. [2025-01-10 01:30:23,818 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 01:30:23,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:23,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 01:30:23,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:30:23,979 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 430 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-01-10 01:30:23,980 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:30:24,566 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 430 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-01-10 01:30:24,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338221201] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:30:24,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:30:24,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2025-01-10 01:30:24,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261534612] [2025-01-10 01:30:24,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:30:24,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-01-10 01:30:24,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:24,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-01-10 01:30:24,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2025-01-10 01:30:24,570 INFO L87 Difference]: Start difference. First operand 108 states and 147 transitions. Second operand has 46 states, 45 states have (on average 3.088888888888889) internal successors, (139), 46 states have internal predecessors, (139), 22 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 22 states have call predecessors, (44), 22 states have call successors, (44) [2025-01-10 01:30:24,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:24,791 INFO L93 Difference]: Finished difference Result 205 states and 291 transitions. [2025-01-10 01:30:24,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-01-10 01:30:24,791 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 3.088888888888889) internal successors, (139), 46 states have internal predecessors, (139), 22 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 22 states have call predecessors, (44), 22 states have call successors, (44) Word has length 156 [2025-01-10 01:30:24,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:24,793 INFO L225 Difference]: With dead ends: 205 [2025-01-10 01:30:24,793 INFO L226 Difference]: Without dead ends: 204 [2025-01-10 01:30:24,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2025-01-10 01:30:24,794 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 83 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:24,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 216 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:30:24,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-01-10 01:30:24,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-01-10 01:30:24,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 153 states have (on average 1.196078431372549) internal successors, (183), 154 states have internal predecessors, (183), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-10 01:30:24,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 279 transitions. [2025-01-10 01:30:24,821 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 279 transitions. Word has length 156 [2025-01-10 01:30:24,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:24,822 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 279 transitions. [2025-01-10 01:30:24,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 3.088888888888889) internal successors, (139), 46 states have internal predecessors, (139), 22 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 22 states have call predecessors, (44), 22 states have call successors, (44) [2025-01-10 01:30:24,822 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 279 transitions. [2025-01-10 01:30:24,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-01-10 01:30:24,830 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:24,830 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 1, 1, 1, 1] [2025-01-10 01:30:24,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:30:25,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:25,031 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:30:25,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:25,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1358880445, now seen corresponding path program 4 times [2025-01-10 01:30:25,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:25,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807183369] [2025-01-10 01:30:25,032 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:30:25,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:25,052 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 324 statements into 2 equivalence classes. [2025-01-10 01:30:25,080 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 324 of 324 statements. [2025-01-10 01:30:25,083 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:30:25,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:27,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3520 backedges. 0 proven. 2068 refuted. 0 times theorem prover too weak. 1452 trivial. 0 not checked. [2025-01-10 01:30:27,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:27,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807183369] [2025-01-10 01:30:27,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807183369] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:30:27,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696603901] [2025-01-10 01:30:27,124 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:30:27,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:27,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:30:27,126 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:30:27,131 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:30:27,168 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 324 statements into 2 equivalence classes. [2025-01-10 01:30:27,233 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 324 of 324 statements. [2025-01-10 01:30:27,233 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:30:27,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:27,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-01-10 01:30:27,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:30:27,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3520 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 1518 trivial. 0 not checked. [2025-01-10 01:30:27,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:30:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3520 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 1518 trivial. 0 not checked. [2025-01-10 01:30:29,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696603901] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:30:29,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:30:29,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 47, 47] total 97 [2025-01-10 01:30:29,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699258473] [2025-01-10 01:30:29,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:30:29,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2025-01-10 01:30:29,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:29,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2025-01-10 01:30:29,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2310, Invalid=7196, Unknown=0, NotChecked=0, Total=9506 [2025-01-10 01:30:29,538 INFO L87 Difference]: Start difference. First operand 204 states and 279 transitions. Second operand has 98 states, 97 states have (on average 2.9690721649484537) internal successors, (288), 97 states have internal predecessors, (288), 47 states have call successors, (93), 2 states have call predecessors, (93), 2 states have return successors, (93), 46 states have call predecessors, (93), 47 states have call successors, (93) [2025-01-10 01:30:33,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:33,312 INFO L93 Difference]: Finished difference Result 1010 states and 1627 transitions. [2025-01-10 01:30:33,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2025-01-10 01:30:33,312 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 97 states have (on average 2.9690721649484537) internal successors, (288), 97 states have internal predecessors, (288), 47 states have call successors, (93), 2 states have call predecessors, (93), 2 states have return successors, (93), 46 states have call predecessors, (93), 47 states have call successors, (93) Word has length 324 [2025-01-10 01:30:33,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:33,323 INFO L225 Difference]: With dead ends: 1010 [2025-01-10 01:30:33,326 INFO L226 Difference]: Without dead ends: 809 [2025-01-10 01:30:33,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 791 GetRequests, 602 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9457 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6868, Invalid=29422, Unknown=0, NotChecked=0, Total=36290 [2025-01-10 01:30:33,337 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 628 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:33,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 408 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [312 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 01:30:33,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2025-01-10 01:30:33,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 792. [2025-01-10 01:30:33,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 593 states have (on average 1.178752107925801) internal successors, (699), 597 states have internal predecessors, (699), 192 states have call successors, (192), 4 states have call predecessors, (192), 6 states have return successors, (336), 192 states have call predecessors, (336), 192 states have call successors, (336) [2025-01-10 01:30:33,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1227 transitions. [2025-01-10 01:30:33,464 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1227 transitions. Word has length 324 [2025-01-10 01:30:33,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:33,467 INFO L471 AbstractCegarLoop]: Abstraction has 792 states and 1227 transitions. [2025-01-10 01:30:33,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 97 states have (on average 2.9690721649484537) internal successors, (288), 97 states have internal predecessors, (288), 47 states have call successors, (93), 2 states have call predecessors, (93), 2 states have return successors, (93), 46 states have call predecessors, (93), 47 states have call successors, (93) [2025-01-10 01:30:33,469 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1227 transitions. [2025-01-10 01:30:33,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2025-01-10 01:30:33,494 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:33,494 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 46, 46, 1, 1, 1, 1] [2025-01-10 01:30:33,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 01:30:33,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-10 01:30:33,695 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:30:33,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:33,699 INFO L85 PathProgramCache]: Analyzing trace with hash 19253451, now seen corresponding path program 5 times [2025-01-10 01:30:33,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:33,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768953123] [2025-01-10 01:30:33,700 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:30:33,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:33,730 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 660 statements into 47 equivalence classes. [2025-01-10 01:30:34,007 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 660 of 660 statements. [2025-01-10 01:30:34,007 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-10 01:30:34,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:39,793 INFO L134 CoverageAnalysis]: Checked inductivity of 15088 backedges. 0 proven. 8602 refuted. 0 times theorem prover too weak. 6486 trivial. 0 not checked. [2025-01-10 01:30:39,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:39,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768953123] [2025-01-10 01:30:39,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768953123] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:30:39,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88657429] [2025-01-10 01:30:39,795 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:30:39,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:39,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:30:39,797 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:30:39,799 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:30:39,863 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 660 statements into 47 equivalence classes. [2025-01-10 01:30:40,051 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 660 of 660 statements. [2025-01-10 01:30:40,052 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-10 01:30:40,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:40,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 1607 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-01-10 01:30:40,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:30:40,500 INFO L134 CoverageAnalysis]: Checked inductivity of 15088 backedges. 0 proven. 8602 refuted. 0 times theorem prover too weak. 6486 trivial. 0 not checked. [2025-01-10 01:30:40,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:30:47,247 INFO L134 CoverageAnalysis]: Checked inductivity of 15088 backedges. 0 proven. 8602 refuted. 0 times theorem prover too weak. 6486 trivial. 0 not checked. [2025-01-10 01:30:47,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88657429] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:30:47,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:30:47,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2025-01-10 01:30:47,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67845410] [2025-01-10 01:30:47,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:30:47,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 190 states [2025-01-10 01:30:47,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:47,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2025-01-10 01:30:47,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9119, Invalid=26791, Unknown=0, NotChecked=0, Total=35910 [2025-01-10 01:30:47,260 INFO L87 Difference]: Start difference. First operand 792 states and 1227 transitions. Second operand has 190 states, 189 states have (on average 3.0211640211640214) internal successors, (571), 190 states have internal predecessors, (571), 94 states have call successors, (188), 1 states have call predecessors, (188), 1 states have return successors, (188), 94 states have call predecessors, (188), 94 states have call successors, (188) [2025-01-10 01:30:48,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:48,546 INFO L93 Difference]: Finished difference Result 1561 states and 2523 transitions. [2025-01-10 01:30:48,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2025-01-10 01:30:48,546 INFO L78 Accepts]: Start accepts. Automaton has has 190 states, 189 states have (on average 3.0211640211640214) internal successors, (571), 190 states have internal predecessors, (571), 94 states have call successors, (188), 1 states have call predecessors, (188), 1 states have return successors, (188), 94 states have call predecessors, (188), 94 states have call successors, (188) Word has length 660 [2025-01-10 01:30:48,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:48,557 INFO L225 Difference]: With dead ends: 1561 [2025-01-10 01:30:48,557 INFO L226 Difference]: Without dead ends: 1560 [2025-01-10 01:30:48,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1413 GetRequests, 1225 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10765 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=9119, Invalid=26791, Unknown=0, NotChecked=0, Total=35910 [2025-01-10 01:30:48,560 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 386 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:48,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 570 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 01:30:48,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2025-01-10 01:30:48,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1560. [2025-01-10 01:30:48,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1560 states, 1169 states have (on average 1.172797262617622) internal successors, (1371), 1173 states have internal predecessors, (1371), 384 states have call successors, (384), 4 states have call predecessors, (384), 6 states have return successors, (672), 384 states have call predecessors, (672), 384 states have call successors, (672) [2025-01-10 01:30:48,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2427 transitions. [2025-01-10 01:30:48,627 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2427 transitions. Word has length 660 [2025-01-10 01:30:48,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:48,630 INFO L471 AbstractCegarLoop]: Abstraction has 1560 states and 2427 transitions. [2025-01-10 01:30:48,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 190 states, 189 states have (on average 3.0211640211640214) internal successors, (571), 190 states have internal predecessors, (571), 94 states have call successors, (188), 1 states have call predecessors, (188), 1 states have return successors, (188), 94 states have call predecessors, (188), 94 states have call successors, (188) [2025-01-10 01:30:48,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2427 transitions. [2025-01-10 01:30:48,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1333 [2025-01-10 01:30:48,665 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:48,665 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 95, 95, 95, 95, 95, 95, 95, 95, 95, 94, 94, 1, 1, 1, 1] [2025-01-10 01:30:48,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 01:30:48,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:48,869 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:30:48,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:48,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1799038939, now seen corresponding path program 6 times [2025-01-10 01:30:48,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:48,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783091778] [2025-01-10 01:30:48,870 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:30:48,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:48,897 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1332 statements into 95 equivalence classes. [2025-01-10 01:30:49,220 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 1332 of 1332 statements. [2025-01-10 01:30:49,221 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-01-10 01:30:49,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:31:18,528 INFO L134 CoverageAnalysis]: Checked inductivity of 62416 backedges. 0 proven. 35626 refuted. 0 times theorem prover too weak. 26790 trivial. 0 not checked. [2025-01-10 01:31:18,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:31:18,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783091778] [2025-01-10 01:31:18,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783091778] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:31:18,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427390556] [2025-01-10 01:31:18,529 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:31:18,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:31:18,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:31:18,532 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:31:18,535 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:31:18,642 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1332 statements into 95 equivalence classes. [2025-01-10 01:31:19,199 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 1332 of 1332 statements. [2025-01-10 01:31:19,199 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-01-10 01:31:19,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:31:19,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 3239 conjuncts, 191 conjuncts are in the unsatisfiable core [2025-01-10 01:31:19,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:31:20,002 INFO L134 CoverageAnalysis]: Checked inductivity of 62416 backedges. 0 proven. 35626 refuted. 0 times theorem prover too weak. 26790 trivial. 0 not checked. [2025-01-10 01:31:20,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:31:43,319 INFO L134 CoverageAnalysis]: Checked inductivity of 62416 backedges. 0 proven. 35626 refuted. 0 times theorem prover too weak. 26790 trivial. 0 not checked. [2025-01-10 01:31:43,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427390556] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:31:43,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:31:43,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [192, 191, 191] total 383 [2025-01-10 01:31:43,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203128494] [2025-01-10 01:31:43,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:31:43,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 384 states [2025-01-10 01:31:43,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:31:43,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 384 interpolants. [2025-01-10 01:31:43,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36917, Invalid=110155, Unknown=0, NotChecked=0, Total=147072 [2025-01-10 01:31:43,335 INFO L87 Difference]: Start difference. First operand 1560 states and 2427 transitions. Second operand has 384 states, 383 states have (on average 3.0078328981723237) internal successors, (1152), 384 states have internal predecessors, (1152), 191 states have call successors, (381), 1 states have call predecessors, (381), 1 states have return successors, (381), 191 states have call predecessors, (381), 191 states have call successors, (381)