./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d 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/uthash-2.0.2/uthash_BER_nondet_test4-3.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:35:09,052 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:35:09,122 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 13:35:09,128 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:35:09,131 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:35:09,153 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:35:09,157 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:35:09,158 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:35:09,158 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:35:09,158 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:35:09,159 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:35:09,159 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:35:09,159 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:35:09,159 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:35:09,159 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:35:09,159 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:35:09,160 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:35:09,160 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 13:35:09,160 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:35:09,160 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 13:35:09,160 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:35:09,161 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:35:09,161 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:35:09,161 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:35:09,161 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:35:09,161 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:35:09,161 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 13:35:09,161 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:35:09,161 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:35:09,161 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:35:09,161 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:35:09,161 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:35:09,161 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:35:09,162 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:35:09,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:35:09,162 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:35:09,162 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:35:09,162 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:35:09,162 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:35:09,162 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:35:09,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:35:09,162 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:35:09,162 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:35:09,162 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:35:09,162 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:35:09,163 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 [2025-02-08 13:35:09,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:35:09,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:35:09,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:35:09,437 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:35:09,438 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:35:09,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-3.i [2025-02-08 13:35:10,654 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/44cf5f976/e7cefddb7dec4b6cbca78e1d7566801b/FLAG7a205a3d1 [2025-02-08 13:35:11,034 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:35:11,035 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-3.i [2025-02-08 13:35:11,052 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/44cf5f976/e7cefddb7dec4b6cbca78e1d7566801b/FLAG7a205a3d1 [2025-02-08 13:35:11,222 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/44cf5f976/e7cefddb7dec4b6cbca78e1d7566801b [2025-02-08 13:35:11,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:35:11,228 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:35:11,229 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:35:11,229 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:35:11,233 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:35:11,237 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:35:11" (1/1) ... [2025-02-08 13:35:11,238 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f70a168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:35:11, skipping insertion in model container [2025-02-08 13:35:11,238 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:35:11" (1/1) ... [2025-02-08 13:35:11,276 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:35:11,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:35:11,729 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:35:11,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:35:11,835 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:35:11,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:35:11 WrapperNode [2025-02-08 13:35:11,836 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:35:11,837 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:35:11,837 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:35:11,837 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:35:11,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:35:11" (1/1) ... [2025-02-08 13:35:11,876 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:35:11" (1/1) ... [2025-02-08 13:35:11,940 INFO L138 Inliner]: procedures = 176, calls = 425, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1813 [2025-02-08 13:35:11,941 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:35:11,941 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:35:11,941 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:35:11,942 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:35:11,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:35:11" (1/1) ... [2025-02-08 13:35:11,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:35:11" (1/1) ... [2025-02-08 13:35:11,959 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:35:11" (1/1) ... [2025-02-08 13:35:12,080 INFO L175 MemorySlicer]: Split 403 memory accesses to 2 slices as follows [2, 401]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 98 writes are split as follows [0, 98]. [2025-02-08 13:35:12,081 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:35:11" (1/1) ... [2025-02-08 13:35:12,081 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:35:11" (1/1) ... [2025-02-08 13:35:12,117 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:35:11" (1/1) ... [2025-02-08 13:35:12,120 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:35:11" (1/1) ... [2025-02-08 13:35:12,124 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:35:11" (1/1) ... [2025-02-08 13:35:12,127 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:35:11" (1/1) ... [2025-02-08 13:35:12,134 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:35:12,136 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:35:12,136 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:35:12,136 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:35:12,137 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:35:11" (1/1) ... [2025-02-08 13:35:12,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:35:12,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:35:12,164 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 13:35:12,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 13:35:12,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 13:35:12,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 13:35:12,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 13:35:12,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 13:35:12,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 13:35:12,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 13:35:12,189 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 13:35:12,189 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 13:35:12,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:35:12,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:35:12,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 13:35:12,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 13:35:12,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 13:35:12,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 13:35:12,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:35:12,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 13:35:12,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 13:35:12,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:35:12,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:35:12,350 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:35:12,351 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:35:13,541 INFO L? ?]: Removed 420 outVars from TransFormulas that were not future-live. [2025-02-08 13:35:13,541 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:35:13,581 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:35:13,581 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-08 13:35:13,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:35:13 BoogieIcfgContainer [2025-02-08 13:35:13,582 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:35:13,583 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:35:13,583 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:35:13,587 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:35:13,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:35:11" (1/3) ... [2025-02-08 13:35:13,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20432bd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:35:13, skipping insertion in model container [2025-02-08 13:35:13,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:35:11" (2/3) ... [2025-02-08 13:35:13,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20432bd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:35:13, skipping insertion in model container [2025-02-08 13:35:13,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:35:13" (3/3) ... [2025-02-08 13:35:13,589 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test4-3.i [2025-02-08 13:35:13,601 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:35:13,602 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_nondet_test4-3.i that has 3 procedures, 468 locations, 1 initial locations, 45 loop locations, and 4 error locations. [2025-02-08 13:35:13,650 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:35:13,659 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;@1a994f6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:35:13,659 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 13:35:13,663 INFO L276 IsEmpty]: Start isEmpty. Operand has 464 states, 451 states have (on average 1.6186252771618626) internal successors, (730), 456 states have internal predecessors, (730), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:35:13,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:35:13,667 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:35:13,668 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 13:35:13,668 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:35:13,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:35:13,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1482895682, now seen corresponding path program 1 times [2025-02-08 13:35:13,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:35:13,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179994371] [2025-02-08 13:35:13,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:13,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:35:13,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:35:13,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:35:13,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:13,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:13,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:35:13,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:35:13,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179994371] [2025-02-08 13:35:13,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179994371] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:35:13,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:35:13,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 13:35:13,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460562332] [2025-02-08 13:35:13,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:35:13,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 13:35:13,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:35:13,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 13:35:13,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 13:35:13,850 INFO L87 Difference]: Start difference. First operand has 464 states, 451 states have (on average 1.6186252771618626) internal successors, (730), 456 states have internal predecessors, (730), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 1 states have (on average 6.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:35:14,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:35:14,079 INFO L93 Difference]: Finished difference Result 923 states and 1480 transitions. [2025-02-08 13:35:14,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 13:35:14,081 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 6.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 13:35:14,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:35:14,088 INFO L225 Difference]: With dead ends: 923 [2025-02-08 13:35:14,088 INFO L226 Difference]: Without dead ends: 393 [2025-02-08 13:35:14,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 13:35:14,096 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:35:14,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 615 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:35:14,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-02-08 13:35:14,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2025-02-08 13:35:14,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 383 states have (on average 1.4490861618798956) internal successors, (555), 385 states have internal predecessors, (555), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:35:14,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 567 transitions. [2025-02-08 13:35:14,142 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 567 transitions. Word has length 6 [2025-02-08 13:35:14,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:35:14,143 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 567 transitions. [2025-02-08 13:35:14,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 6.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:35:14,143 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 567 transitions. [2025-02-08 13:35:14,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 13:35:14,143 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:35:14,143 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:35:14,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:35:14,144 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:35:14,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:35:14,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1274874862, now seen corresponding path program 1 times [2025-02-08 13:35:14,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:35:14,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618705619] [2025-02-08 13:35:14,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:14,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:35:14,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:35:14,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:35:14,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:14,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 13:35:14,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1301408313] [2025-02-08 13:35:14,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:14,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:35:14,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:35:14,170 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:35:14,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 13:35:14,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:35:14,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:35:14,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:14,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:14,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:35:14,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:35:14,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:35:14,347 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:35:14,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:35:14,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618705619] [2025-02-08 13:35:14,347 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 13:35:14,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301408313] [2025-02-08 13:35:14,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301408313] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:35:14,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:35:14,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:35:14,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911634210] [2025-02-08 13:35:14,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:35:14,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:35:14,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:35:14,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:35:14,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:35:14,349 INFO L87 Difference]: Start difference. First operand 393 states and 567 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:35:14,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:35:14,508 INFO L93 Difference]: Finished difference Result 776 states and 1124 transitions. [2025-02-08 13:35:14,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:35:14,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 13:35:14,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:35:14,512 INFO L225 Difference]: With dead ends: 776 [2025-02-08 13:35:14,512 INFO L226 Difference]: Without dead ends: 775 [2025-02-08 13:35:14,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:35:14,513 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 539 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:35:14,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1076 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:35:14,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2025-02-08 13:35:14,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 398. [2025-02-08 13:35:14,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 388 states have (on average 1.443298969072165) internal successors, (560), 390 states have internal predecessors, (560), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:35:14,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 572 transitions. [2025-02-08 13:35:14,549 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 572 transitions. Word has length 7 [2025-02-08 13:35:14,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:35:14,549 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 572 transitions. [2025-02-08 13:35:14,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:35:14,549 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 572 transitions. [2025-02-08 13:35:14,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-08 13:35:14,556 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:35:14,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:35:14,575 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-02-08 13:35:14,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:35:14,758 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:35:14,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:35:14,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1535905390, now seen corresponding path program 1 times [2025-02-08 13:35:14,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:35:14,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871521895] [2025-02-08 13:35:14,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:14,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:35:14,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-08 13:35:14,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-08 13:35:14,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:14,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:15,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:35:15,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:35:15,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871521895] [2025-02-08 13:35:15,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871521895] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:35:15,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:35:15,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:35:15,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636320296] [2025-02-08 13:35:15,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:35:15,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:35:15,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:35:15,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:35:15,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:35:15,287 INFO L87 Difference]: Start difference. First operand 398 states and 572 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:35:15,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:35:15,432 INFO L93 Difference]: Finished difference Result 792 states and 1140 transitions. [2025-02-08 13:35:15,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:35:15,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2025-02-08 13:35:15,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:35:15,434 INFO L225 Difference]: With dead ends: 792 [2025-02-08 13:35:15,435 INFO L226 Difference]: Without dead ends: 401 [2025-02-08 13:35:15,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:35:15,436 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 105 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:35:15,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1404 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:35:15,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-02-08 13:35:15,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 398. [2025-02-08 13:35:15,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 388 states have (on average 1.425257731958763) internal successors, (553), 390 states have internal predecessors, (553), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:35:15,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 565 transitions. [2025-02-08 13:35:15,445 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 565 transitions. Word has length 149 [2025-02-08 13:35:15,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:35:15,446 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 565 transitions. [2025-02-08 13:35:15,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:35:15,446 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 565 transitions. [2025-02-08 13:35:15,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-08 13:35:15,447 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:35:15,448 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:35:15,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:35:15,448 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:35:15,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:35:15,449 INFO L85 PathProgramCache]: Analyzing trace with hash -157037305, now seen corresponding path program 1 times [2025-02-08 13:35:15,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:35:15,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203354393] [2025-02-08 13:35:15,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:15,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:35:15,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-08 13:35:15,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-08 13:35:15,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:15,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:15,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:35:15,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:35:15,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203354393] [2025-02-08 13:35:15,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203354393] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:35:15,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:35:15,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:35:15,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033767023] [2025-02-08 13:35:15,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:35:15,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:35:15,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:35:15,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:35:15,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:35:15,682 INFO L87 Difference]: Start difference. First operand 398 states and 565 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:35:15,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:35:15,807 INFO L93 Difference]: Finished difference Result 795 states and 1132 transitions. [2025-02-08 13:35:15,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:35:15,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2025-02-08 13:35:15,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:35:15,809 INFO L225 Difference]: With dead ends: 795 [2025-02-08 13:35:15,809 INFO L226 Difference]: Without dead ends: 404 [2025-02-08 13:35:15,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:35:15,814 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 1 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:35:15,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 998 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:35:15,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-02-08 13:35:15,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2025-02-08 13:35:15,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 394 states have (on average 1.4187817258883249) internal successors, (559), 396 states have internal predecessors, (559), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:35:15,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 571 transitions. [2025-02-08 13:35:15,834 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 571 transitions. Word has length 149 [2025-02-08 13:35:15,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:35:15,834 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 571 transitions. [2025-02-08 13:35:15,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:35:15,834 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 571 transitions. [2025-02-08 13:35:15,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-08 13:35:15,838 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:35:15,839 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:35:15,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 13:35:15,839 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:35:15,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:35:15,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1758203352, now seen corresponding path program 1 times [2025-02-08 13:35:15,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:35:15,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363234787] [2025-02-08 13:35:15,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:15,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:35:15,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-08 13:35:15,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-08 13:35:15,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:15,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:16,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:35:16,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:35:16,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363234787] [2025-02-08 13:35:16,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363234787] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:35:16,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:35:16,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:35:16,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723182142] [2025-02-08 13:35:16,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:35:16,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:35:16,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:35:16,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:35:16,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:35:16,175 INFO L87 Difference]: Start difference. First operand 404 states and 571 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:35:16,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:35:16,349 INFO L93 Difference]: Finished difference Result 933 states and 1327 transitions. [2025-02-08 13:35:16,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:35:16,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2025-02-08 13:35:16,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:35:16,353 INFO L225 Difference]: With dead ends: 933 [2025-02-08 13:35:16,355 INFO L226 Difference]: Without dead ends: 536 [2025-02-08 13:35:16,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:35:16,356 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 134 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:35:16,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1022 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:35:16,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-02-08 13:35:16,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-02-08 13:35:16,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 526 states have (on average 1.4258555133079849) internal successors, (750), 528 states have internal predecessors, (750), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:35:16,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 762 transitions. [2025-02-08 13:35:16,374 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 762 transitions. Word has length 149 [2025-02-08 13:35:16,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:35:16,374 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 762 transitions. [2025-02-08 13:35:16,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:35:16,375 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 762 transitions. [2025-02-08 13:35:16,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-08 13:35:16,377 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:35:16,377 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:35:16,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 13:35:16,377 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:35:16,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:35:16,378 INFO L85 PathProgramCache]: Analyzing trace with hash 35154131, now seen corresponding path program 1 times [2025-02-08 13:35:16,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:35:16,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639691551] [2025-02-08 13:35:16,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:16,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:35:16,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-08 13:35:16,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-08 13:35:16,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:16,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:16,648 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:35:16,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:35:16,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639691551] [2025-02-08 13:35:16,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639691551] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:35:16,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:35:16,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:35:16,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883121218] [2025-02-08 13:35:16,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:35:16,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:35:16,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:35:16,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:35:16,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:35:16,651 INFO L87 Difference]: Start difference. First operand 536 states and 762 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:35:16,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:35:16,785 INFO L93 Difference]: Finished difference Result 936 states and 1329 transitions. [2025-02-08 13:35:16,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:35:16,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 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 164 [2025-02-08 13:35:16,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:35:16,789 INFO L225 Difference]: With dead ends: 936 [2025-02-08 13:35:16,790 INFO L226 Difference]: Without dead ends: 539 [2025-02-08 13:35:16,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:35:16,793 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 106 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1383 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:35:16,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1383 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:35:16,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-08 13:35:16,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 536. [2025-02-08 13:35:16,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 526 states have (on average 1.4125475285171103) internal successors, (743), 528 states have internal predecessors, (743), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:35:16,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 755 transitions. [2025-02-08 13:35:16,811 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 755 transitions. Word has length 164 [2025-02-08 13:35:16,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:35:16,812 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 755 transitions. [2025-02-08 13:35:16,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:35:16,812 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 755 transitions. [2025-02-08 13:35:16,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-08 13:35:16,813 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:35:16,813 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:35:16,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:35:16,814 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:35:16,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:35:16,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1350789588, now seen corresponding path program 1 times [2025-02-08 13:35:16,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:35:16,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643244443] [2025-02-08 13:35:16,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:16,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:35:16,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-08 13:35:16,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-08 13:35:16,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:16,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:17,041 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:35:17,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:35:17,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643244443] [2025-02-08 13:35:17,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643244443] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:35:17,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:35:17,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:35:17,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055544582] [2025-02-08 13:35:17,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:35:17,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:35:17,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:35:17,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:35:17,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:35:17,046 INFO L87 Difference]: Start difference. First operand 536 states and 755 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:35:17,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:35:17,154 INFO L93 Difference]: Finished difference Result 885 states and 1237 transitions. [2025-02-08 13:35:17,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:35:17,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 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 164 [2025-02-08 13:35:17,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:35:17,157 INFO L225 Difference]: With dead ends: 885 [2025-02-08 13:35:17,157 INFO L226 Difference]: Without dead ends: 488 [2025-02-08 13:35:17,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:35:17,159 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 9 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:35:17,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1250 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:35:17,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-02-08 13:35:17,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2025-02-08 13:35:17,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 478 states have (on average 1.387029288702929) internal successors, (663), 480 states have internal predecessors, (663), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:35:17,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 675 transitions. [2025-02-08 13:35:17,174 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 675 transitions. Word has length 164 [2025-02-08 13:35:17,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:35:17,174 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 675 transitions. [2025-02-08 13:35:17,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:35:17,175 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 675 transitions. [2025-02-08 13:35:17,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-08 13:35:17,178 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:35:17,179 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:35:17,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:35:17,179 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:35:17,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:35:17,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1788799091, now seen corresponding path program 1 times [2025-02-08 13:35:17,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:35:17,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690864658] [2025-02-08 13:35:17,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:17,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:35:17,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-08 13:35:17,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-08 13:35:17,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:17,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:17,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:35:17,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:35:17,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690864658] [2025-02-08 13:35:17,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690864658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:35:17,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:35:17,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:35:17,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939737976] [2025-02-08 13:35:17,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:35:17,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:35:17,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:35:17,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:35:17,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:35:17,418 INFO L87 Difference]: Start difference. First operand 488 states and 675 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:35:17,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:35:17,532 INFO L93 Difference]: Finished difference Result 975 states and 1338 transitions. [2025-02-08 13:35:17,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:35:17,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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 164 [2025-02-08 13:35:17,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:35:17,535 INFO L225 Difference]: With dead ends: 975 [2025-02-08 13:35:17,535 INFO L226 Difference]: Without dead ends: 626 [2025-02-08 13:35:17,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:35:17,536 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 238 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:35:17,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 866 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:35:17,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-02-08 13:35:17,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2025-02-08 13:35:17,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 613 states have (on average 1.3735725938009788) internal successors, (842), 615 states have internal predecessors, (842), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 13:35:17,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 860 transitions. [2025-02-08 13:35:17,553 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 860 transitions. Word has length 164 [2025-02-08 13:35:17,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:35:17,554 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 860 transitions. [2025-02-08 13:35:17,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:35:17,554 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 860 transitions. [2025-02-08 13:35:17,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-08 13:35:17,555 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:35:17,555 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:35:17,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 13:35:17,555 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:35:17,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:35:17,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1577714554, now seen corresponding path program 1 times [2025-02-08 13:35:17,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:35:17,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791887333] [2025-02-08 13:35:17,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:17,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:35:17,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-08 13:35:17,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-08 13:35:17,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:17,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:17,893 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 13:35:17,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:35:17,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791887333] [2025-02-08 13:35:17,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791887333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:35:17,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:35:17,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:35:17,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115955521] [2025-02-08 13:35:17,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:35:17,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:35:17,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:35:17,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:35:17,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:35:17,895 INFO L87 Difference]: Start difference. First operand 626 states and 860 transitions. Second operand has 4 states, 3 states have (on average 54.0) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:35:18,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:35:18,021 INFO L93 Difference]: Finished difference Result 691 states and 945 transitions. [2025-02-08 13:35:18,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:35:18,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 54.0) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 179 [2025-02-08 13:35:18,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:35:18,024 INFO L225 Difference]: With dead ends: 691 [2025-02-08 13:35:18,024 INFO L226 Difference]: Without dead ends: 689 [2025-02-08 13:35:18,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:35:18,025 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 289 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:35:18,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 1365 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:35:18,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-02-08 13:35:18,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2025-02-08 13:35:18,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 673 states have (on average 1.3655274888558693) internal successors, (919), 675 states have internal predecessors, (919), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 13:35:18,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 943 transitions. [2025-02-08 13:35:18,043 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 943 transitions. Word has length 179 [2025-02-08 13:35:18,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:35:18,043 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 943 transitions. [2025-02-08 13:35:18,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 54.0) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:35:18,044 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 943 transitions. [2025-02-08 13:35:18,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-02-08 13:35:18,045 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:35:18,045 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:35:18,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 13:35:18,045 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:35:18,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:35:18,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1354336646, now seen corresponding path program 1 times [2025-02-08 13:35:18,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:35:18,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893137556] [2025-02-08 13:35:18,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:18,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:35:18,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-08 13:35:18,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-08 13:35:18,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:18,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:19,103 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 13:35:19,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:35:19,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893137556] [2025-02-08 13:35:19,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893137556] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:35:19,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559116979] [2025-02-08 13:35:19,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:19,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:35:19,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:35:19,107 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:35:19,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 13:35:19,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-08 13:35:19,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-08 13:35:19,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:19,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:19,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-08 13:35:19,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:35:19,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 13:35:19,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 13:35:20,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 13:35:20,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 55 [2025-02-08 13:35:20,240 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 13:35:20,240 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:35:20,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559116979] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:35:20,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:35:20,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-02-08 13:35:20,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542325515] [2025-02-08 13:35:20,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:35:20,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 13:35:20,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:35:20,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 13:35:20,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-02-08 13:35:20,242 INFO L87 Difference]: Start difference. First operand 689 states and 943 transitions. Second operand has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 11 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:35:21,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:35:21,751 INFO L93 Difference]: Finished difference Result 1324 states and 1805 transitions. [2025-02-08 13:35:21,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 13:35:21,752 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 11 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 185 [2025-02-08 13:35:21,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:35:21,754 INFO L225 Difference]: With dead ends: 1324 [2025-02-08 13:35:21,754 INFO L226 Difference]: Without dead ends: 727 [2025-02-08 13:35:21,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-02-08 13:35:21,755 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 724 mSDsluCounter, 1891 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 2312 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:35:21,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 2312 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-08 13:35:21,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2025-02-08 13:35:21,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 720. [2025-02-08 13:35:21,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 704 states have (on average 1.3565340909090908) internal successors, (955), 706 states have internal predecessors, (955), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 13:35:21,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 979 transitions. [2025-02-08 13:35:21,771 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 979 transitions. Word has length 185 [2025-02-08 13:35:21,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:35:21,771 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 979 transitions. [2025-02-08 13:35:21,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 11 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:35:21,772 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 979 transitions. [2025-02-08 13:35:21,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-02-08 13:35:21,773 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:35:21,773 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:35:21,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 13:35:21,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:35:21,974 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:35:21,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:35:21,974 INFO L85 PathProgramCache]: Analyzing trace with hash -697466376, now seen corresponding path program 1 times [2025-02-08 13:35:21,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:35:21,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980680522] [2025-02-08 13:35:21,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:21,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:35:22,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-08 13:35:22,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-08 13:35:22,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:22,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:22,181 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 13:35:22,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:35:22,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980680522] [2025-02-08 13:35:22,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980680522] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:35:22,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:35:22,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:35:22,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665095808] [2025-02-08 13:35:22,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:35:22,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:35:22,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:35:22,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:35:22,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:35:22,183 INFO L87 Difference]: Start difference. First operand 720 states and 979 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:35:22,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:35:22,273 INFO L93 Difference]: Finished difference Result 1273 states and 1723 transitions. [2025-02-08 13:35:22,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:35:22,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 185 [2025-02-08 13:35:22,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:35:22,276 INFO L225 Difference]: With dead ends: 1273 [2025-02-08 13:35:22,276 INFO L226 Difference]: Without dead ends: 581 [2025-02-08 13:35:22,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:35:22,278 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 9 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:35:22,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1037 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:35:22,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-02-08 13:35:22,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 581. [2025-02-08 13:35:22,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 565 states have (on average 1.320353982300885) internal successors, (746), 567 states have internal predecessors, (746), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 13:35:22,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 770 transitions. [2025-02-08 13:35:22,293 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 770 transitions. Word has length 185 [2025-02-08 13:35:22,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:35:22,294 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 770 transitions. [2025-02-08 13:35:22,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:35:22,295 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 770 transitions. [2025-02-08 13:35:22,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-02-08 13:35:22,296 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:35:22,296 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:35:22,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 13:35:22,296 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:35:22,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:35:22,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1676945149, now seen corresponding path program 1 times [2025-02-08 13:35:22,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:35:22,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140784183] [2025-02-08 13:35:22,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:22,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:35:22,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-08 13:35:22,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-08 13:35:22,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:22,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:22,940 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 13:35:22,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:35:22,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140784183] [2025-02-08 13:35:22,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140784183] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:35:22,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693516182] [2025-02-08 13:35:22,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:22,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:35:22,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:35:22,946 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:35:22,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 13:35:23,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-08 13:35:23,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-08 13:35:23,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:23,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:23,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 13:35:23,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:35:23,598 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 13:35:23,598 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:35:23,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693516182] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:35:23,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:35:23,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 6 [2025-02-08 13:35:23,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392721954] [2025-02-08 13:35:23,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:35:23,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:35:23,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:35:23,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:35:23,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:35:23,599 INFO L87 Difference]: Start difference. First operand 581 states and 770 transitions. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 13:35:23,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:35:23,738 INFO L93 Difference]: Finished difference Result 1077 states and 1440 transitions. [2025-02-08 13:35:23,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:35:23,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 186 [2025-02-08 13:35:23,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:35:23,743 INFO L225 Difference]: With dead ends: 1077 [2025-02-08 13:35:23,743 INFO L226 Difference]: Without dead ends: 584 [2025-02-08 13:35:23,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:35:23,744 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 362 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:35:23,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1421 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:35:23,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2025-02-08 13:35:23,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2025-02-08 13:35:23,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 567 states have (on average 1.3209876543209877) internal successors, (749), 570 states have internal predecessors, (749), 12 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2025-02-08 13:35:23,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 777 transitions. [2025-02-08 13:35:23,761 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 777 transitions. Word has length 186 [2025-02-08 13:35:23,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:35:23,761 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 777 transitions. [2025-02-08 13:35:23,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 13:35:23,761 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 777 transitions. [2025-02-08 13:35:23,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-08 13:35:23,763 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:35:23,763 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:35:23,773 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-02-08 13:35:23,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:35:23,964 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:35:23,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:35:23,964 INFO L85 PathProgramCache]: Analyzing trace with hash 259092611, now seen corresponding path program 1 times [2025-02-08 13:35:23,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:35:23,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928286116] [2025-02-08 13:35:23,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:23,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:35:24,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-08 13:35:24,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-08 13:35:24,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:24,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:24,770 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-08 13:35:24,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:35:24,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928286116] [2025-02-08 13:35:24,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928286116] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:35:24,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635041588] [2025-02-08 13:35:24,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:24,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:35:24,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:35:24,775 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:35:24,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 13:35:25,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-08 13:35:25,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-08 13:35:25,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:25,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:25,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 1099 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-08 13:35:25,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:35:25,388 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-08 13:35:25,389 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:35:25,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635041588] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:35:25,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:35:25,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-02-08 13:35:25,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768690781] [2025-02-08 13:35:25,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:35:25,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:35:25,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:35:25,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:35:25,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:35:25,390 INFO L87 Difference]: Start difference. First operand 584 states and 777 transitions. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:35:25,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:35:25,537 INFO L93 Difference]: Finished difference Result 1130 states and 1514 transitions. [2025-02-08 13:35:25,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:35:25,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 190 [2025-02-08 13:35:25,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:35:25,540 INFO L225 Difference]: With dead ends: 1130 [2025-02-08 13:35:25,540 INFO L226 Difference]: Without dead ends: 584 [2025-02-08 13:35:25,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:35:25,543 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 13 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:35:25,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 963 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:35:25,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2025-02-08 13:35:25,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2025-02-08 13:35:25,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 567 states have (on average 1.3174603174603174) internal successors, (747), 570 states have internal predecessors, (747), 12 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2025-02-08 13:35:25,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 775 transitions. [2025-02-08 13:35:25,566 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 775 transitions. Word has length 190 [2025-02-08 13:35:25,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:35:25,567 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 775 transitions. [2025-02-08 13:35:25,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:35:25,568 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 775 transitions. [2025-02-08 13:35:25,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-02-08 13:35:25,569 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:35:25,570 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:35:25,591 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-02-08 13:35:25,770 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,SelfDestructingSolverStorable12 [2025-02-08 13:35:25,771 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:35:25,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:35:25,772 INFO L85 PathProgramCache]: Analyzing trace with hash 189599133, now seen corresponding path program 1 times [2025-02-08 13:35:25,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:35:25,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14898885] [2025-02-08 13:35:25,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:25,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:35:25,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-08 13:35:25,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-08 13:35:25,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:25,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:26,226 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-08 13:35:26,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:35:26,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14898885] [2025-02-08 13:35:26,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14898885] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:35:26,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:35:26,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 13:35:26,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670548315] [2025-02-08 13:35:26,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:35:26,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:35:26,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:35:26,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:35:26,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:35:26,229 INFO L87 Difference]: Start difference. First operand 584 states and 775 transitions. Second operand has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:35:26,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:35:26,500 INFO L93 Difference]: Finished difference Result 1133 states and 1516 transitions. [2025-02-08 13:35:26,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:35:26,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 191 [2025-02-08 13:35:26,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:35:26,503 INFO L225 Difference]: With dead ends: 1133 [2025-02-08 13:35:26,503 INFO L226 Difference]: Without dead ends: 590 [2025-02-08 13:35:26,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:35:26,504 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 4 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:35:26,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1529 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:35:26,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2025-02-08 13:35:26,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2025-02-08 13:35:26,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 573 states have (on average 1.3141361256544504) internal successors, (753), 576 states have internal predecessors, (753), 12 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2025-02-08 13:35:26,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 781 transitions. [2025-02-08 13:35:26,518 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 781 transitions. Word has length 191 [2025-02-08 13:35:26,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:35:26,518 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 781 transitions. [2025-02-08 13:35:26,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:35:26,519 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 781 transitions. [2025-02-08 13:35:26,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-08 13:35:26,520 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:35:26,520 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:35:26,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 13:35:26,520 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:35:26,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:35:26,521 INFO L85 PathProgramCache]: Analyzing trace with hash -12355961, now seen corresponding path program 1 times [2025-02-08 13:35:26,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:35:26,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595234038] [2025-02-08 13:35:26,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:26,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:35:26,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-08 13:35:26,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-08 13:35:26,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:26,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:26,870 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-08 13:35:26,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:35:26,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595234038] [2025-02-08 13:35:26,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595234038] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:35:26,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:35:26,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 13:35:26,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275101375] [2025-02-08 13:35:26,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:35:26,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:35:26,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:35:26,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:35:26,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:35:26,872 INFO L87 Difference]: Start difference. First operand 590 states and 781 transitions. Second operand has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:35:27,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:35:27,169 INFO L93 Difference]: Finished difference Result 1139 states and 1520 transitions. [2025-02-08 13:35:27,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 13:35:27,170 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 192 [2025-02-08 13:35:27,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:35:27,172 INFO L225 Difference]: With dead ends: 1139 [2025-02-08 13:35:27,173 INFO L226 Difference]: Without dead ends: 600 [2025-02-08 13:35:27,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:35:27,175 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 8 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1812 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:35:27,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1812 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 13:35:27,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-02-08 13:35:27,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 598. [2025-02-08 13:35:27,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 581 states have (on average 1.3132530120481927) internal successors, (763), 584 states have internal predecessors, (763), 12 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2025-02-08 13:35:27,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 791 transitions. [2025-02-08 13:35:27,190 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 791 transitions. Word has length 192 [2025-02-08 13:35:27,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:35:27,190 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 791 transitions. [2025-02-08 13:35:27,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:35:27,190 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 791 transitions. [2025-02-08 13:35:27,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-08 13:35:27,191 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:35:27,191 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:35:27,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 13:35:27,192 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:35:27,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:35:27,192 INFO L85 PathProgramCache]: Analyzing trace with hash 125922682, now seen corresponding path program 1 times [2025-02-08 13:35:27,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:35:27,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494407081] [2025-02-08 13:35:27,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:27,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:35:27,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-08 13:35:27,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-08 13:35:27,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:27,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:27,896 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-08 13:35:27,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:35:27,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494407081] [2025-02-08 13:35:27,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494407081] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:35:27,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721682078] [2025-02-08 13:35:27,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:27,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:35:27,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:35:27,902 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:35:27,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 13:35:28,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-08 13:35:28,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-08 13:35:28,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:28,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:28,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 1098 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-08 13:35:28,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:35:28,580 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-08 13:35:28,580 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:35:28,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721682078] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:35:28,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:35:28,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2025-02-08 13:35:28,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597574698] [2025-02-08 13:35:28,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:35:28,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 13:35:28,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:35:28,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 13:35:28,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 13:35:28,582 INFO L87 Difference]: Start difference. First operand 598 states and 791 transitions. Second operand has 9 states, 9 states have (on average 19.555555555555557) internal successors, (176), 9 states have internal predecessors, (176), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 13:35:28,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:35:28,863 INFO L93 Difference]: Finished difference Result 1035 states and 1383 transitions. [2025-02-08 13:35:28,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 13:35:28,863 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.555555555555557) internal successors, (176), 9 states have internal predecessors, (176), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 192 [2025-02-08 13:35:28,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:35:28,866 INFO L225 Difference]: With dead ends: 1035 [2025-02-08 13:35:28,866 INFO L226 Difference]: Without dead ends: 620 [2025-02-08 13:35:28,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 13:35:28,867 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 21 mSDsluCounter, 1527 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:35:28,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1876 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 13:35:28,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2025-02-08 13:35:28,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 612. [2025-02-08 13:35:28,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 595 states have (on average 1.3092436974789916) internal successors, (779), 598 states have internal predecessors, (779), 12 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2025-02-08 13:35:28,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 807 transitions. [2025-02-08 13:35:28,882 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 807 transitions. Word has length 192 [2025-02-08 13:35:28,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:35:28,882 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 807 transitions. [2025-02-08 13:35:28,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.555555555555557) internal successors, (176), 9 states have internal predecessors, (176), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 13:35:28,882 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 807 transitions. [2025-02-08 13:35:28,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-02-08 13:35:28,883 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:35:28,884 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:35:28,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 13:35:29,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-08 13:35:29,085 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:35:29,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:35:29,086 INFO L85 PathProgramCache]: Analyzing trace with hash 712594493, now seen corresponding path program 1 times [2025-02-08 13:35:29,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:35:29,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554265266] [2025-02-08 13:35:29,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:29,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:35:29,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-08 13:35:29,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-08 13:35:29,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:29,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:29,462 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-08 13:35:29,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:35:29,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554265266] [2025-02-08 13:35:29,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554265266] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:35:29,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:35:29,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 13:35:29,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986296947] [2025-02-08 13:35:29,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:35:29,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:35:29,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:35:29,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:35:29,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:35:29,465 INFO L87 Difference]: Start difference. First operand 612 states and 807 transitions. Second operand has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 13:35:29,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:35:29,754 INFO L93 Difference]: Finished difference Result 1029 states and 1366 transitions. [2025-02-08 13:35:29,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:35:29,754 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 193 [2025-02-08 13:35:29,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:35:29,757 INFO L225 Difference]: With dead ends: 1029 [2025-02-08 13:35:29,757 INFO L226 Difference]: Without dead ends: 608 [2025-02-08 13:35:29,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:35:29,758 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 9 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1507 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:35:29,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1507 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 13:35:29,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-02-08 13:35:29,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 606. [2025-02-08 13:35:29,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 589 states have (on average 1.3056027164685908) internal successors, (769), 592 states have internal predecessors, (769), 12 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2025-02-08 13:35:29,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 797 transitions. [2025-02-08 13:35:29,770 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 797 transitions. Word has length 193 [2025-02-08 13:35:29,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:35:29,771 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 797 transitions. [2025-02-08 13:35:29,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 13:35:29,771 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 797 transitions. [2025-02-08 13:35:29,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-02-08 13:35:29,773 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:35:29,773 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:35:29,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 13:35:29,774 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:35:29,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:35:29,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1449202935, now seen corresponding path program 1 times [2025-02-08 13:35:29,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:35:29,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698173158] [2025-02-08 13:35:29,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:29,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:35:29,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-08 13:35:29,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-08 13:35:29,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:29,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:30,050 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-08 13:35:30,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:35:30,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698173158] [2025-02-08 13:35:30,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698173158] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:35:30,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:35:30,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 13:35:30,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854212328] [2025-02-08 13:35:30,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:35:30,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:35:30,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:35:30,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:35:30,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:35:30,053 INFO L87 Difference]: Start difference. First operand 606 states and 797 transitions. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 13:35:30,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:35:30,255 INFO L93 Difference]: Finished difference Result 1028 states and 1363 transitions. [2025-02-08 13:35:30,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:35:30,256 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 194 [2025-02-08 13:35:30,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:35:30,258 INFO L225 Difference]: With dead ends: 1028 [2025-02-08 13:35:30,259 INFO L226 Difference]: Without dead ends: 612 [2025-02-08 13:35:30,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:35:30,260 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 4 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:35:30,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1251 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:35:30,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-02-08 13:35:30,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2025-02-08 13:35:30,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 595 states have (on average 1.3025210084033614) internal successors, (775), 598 states have internal predecessors, (775), 12 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2025-02-08 13:35:30,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 803 transitions. [2025-02-08 13:35:30,274 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 803 transitions. Word has length 194 [2025-02-08 13:35:30,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:35:30,275 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 803 transitions. [2025-02-08 13:35:30,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 13:35:30,275 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 803 transitions. [2025-02-08 13:35:30,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-08 13:35:30,276 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:35:30,276 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:35:30,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 13:35:30,277 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:35:30,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:35:30,278 INFO L85 PathProgramCache]: Analyzing trace with hash -254946136, now seen corresponding path program 1 times [2025-02-08 13:35:30,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:35:30,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527222061] [2025-02-08 13:35:30,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:30,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:35:30,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-08 13:35:30,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-08 13:35:30,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:30,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:31,017 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-08 13:35:31,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:35:31,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527222061] [2025-02-08 13:35:31,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527222061] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:35:31,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978621762] [2025-02-08 13:35:31,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:31,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:35:31,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:35:31,020 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:35:31,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 13:35:31,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-08 13:35:31,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-08 13:35:31,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:31,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:31,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 1098 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-08 13:35:31,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:35:32,015 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 26 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 13:35:32,015 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:35:32,351 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-08 13:35:32,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978621762] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:35:32,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:35:32,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 8] total 14 [2025-02-08 13:35:32,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984648350] [2025-02-08 13:35:32,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:35:32,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 13:35:32,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:35:32,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 13:35:32,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:35:32,353 INFO L87 Difference]: Start difference. First operand 612 states and 803 transitions. Second operand has 14 states, 14 states have (on average 25.428571428571427) internal successors, (356), 14 states have internal predecessors, (356), 4 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-02-08 13:35:32,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:35:32,676 INFO L93 Difference]: Finished difference Result 1140 states and 1515 transitions. [2025-02-08 13:35:32,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 13:35:32,677 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 25.428571428571427) internal successors, (356), 14 states have internal predecessors, (356), 4 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 195 [2025-02-08 13:35:32,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:35:32,679 INFO L225 Difference]: With dead ends: 1140 [2025-02-08 13:35:32,679 INFO L226 Difference]: Without dead ends: 621 [2025-02-08 13:35:32,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2025-02-08 13:35:32,680 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 304 mSDsluCounter, 2680 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 3074 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:35:32,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 3074 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 13:35:32,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2025-02-08 13:35:32,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2025-02-08 13:35:32,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 603 states have (on average 1.3051409618573797) internal successors, (787), 606 states have internal predecessors, (787), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2025-02-08 13:35:32,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 815 transitions. [2025-02-08 13:35:32,691 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 815 transitions. Word has length 195 [2025-02-08 13:35:32,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:35:32,691 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 815 transitions. [2025-02-08 13:35:32,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 25.428571428571427) internal successors, (356), 14 states have internal predecessors, (356), 4 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-02-08 13:35:32,691 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 815 transitions. [2025-02-08 13:35:32,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-08 13:35:32,692 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:35:32,693 INFO L218 NwaCegarLoop]: trace histogram [12, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:35:32,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 13:35:32,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:35:32,897 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:35:32,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:35:32,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1955357728, now seen corresponding path program 2 times [2025-02-08 13:35:32,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:35:32,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473317064] [2025-02-08 13:35:32,898 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:35:32,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:35:32,949 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 203 statements into 2 equivalence classes. [2025-02-08 13:35:33,452 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 203 of 203 statements. [2025-02-08 13:35:33,453 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:35:33,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:33,716 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 5 proven. 71 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-02-08 13:35:33,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:35:33,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473317064] [2025-02-08 13:35:33,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473317064] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:35:33,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714730371] [2025-02-08 13:35:33,717 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:35:33,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:35:33,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:35:33,719 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:35:33,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 13:35:34,110 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 203 statements into 2 equivalence classes. [2025-02-08 13:35:34,413 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 203 of 203 statements. [2025-02-08 13:35:34,413 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:35:34,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:34,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 1218 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 13:35:34,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:35:34,488 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 69 proven. 10 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-08 13:35:34,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:35:38,740 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 5 proven. 70 refuted. 1 times theorem prover too weak. 67 trivial. 0 not checked. [2025-02-08 13:35:38,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714730371] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:35:38,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:35:38,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 19 [2025-02-08 13:35:38,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340947924] [2025-02-08 13:35:38,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:35:38,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 13:35:38,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:35:38,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 13:35:38,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=231, Unknown=1, NotChecked=0, Total=342 [2025-02-08 13:35:38,745 INFO L87 Difference]: Start difference. First operand 621 states and 815 transitions. Second operand has 19 states, 19 states have (on average 10.526315789473685) internal successors, (200), 19 states have internal predecessors, (200), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-08 13:35:39,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:35:39,409 INFO L93 Difference]: Finished difference Result 1162 states and 1545 transitions. [2025-02-08 13:35:39,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-08 13:35:39,410 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 10.526315789473685) internal successors, (200), 19 states have internal predecessors, (200), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 203 [2025-02-08 13:35:39,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:35:39,412 INFO L225 Difference]: With dead ends: 1162 [2025-02-08 13:35:39,413 INFO L226 Difference]: Without dead ends: 630 [2025-02-08 13:35:39,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=267, Invalid=488, Unknown=1, NotChecked=0, Total=756 [2025-02-08 13:35:39,415 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 31 mSDsluCounter, 2754 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3104 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 13:35:39,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3104 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 13:35:39,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2025-02-08 13:35:39,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2025-02-08 13:35:39,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 612 states have (on average 1.303921568627451) internal successors, (798), 615 states have internal predecessors, (798), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2025-02-08 13:35:39,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 826 transitions. [2025-02-08 13:35:39,430 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 826 transitions. Word has length 203 [2025-02-08 13:35:39,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:35:39,431 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 826 transitions. [2025-02-08 13:35:39,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.526315789473685) internal successors, (200), 19 states have internal predecessors, (200), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-08 13:35:39,431 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 826 transitions. [2025-02-08 13:35:39,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-02-08 13:35:39,432 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:35:39,432 INFO L218 NwaCegarLoop]: trace histogram [24, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:35:39,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 13:35:39,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:35:39,633 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:35:39,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:35:39,634 INFO L85 PathProgramCache]: Analyzing trace with hash 909921184, now seen corresponding path program 3 times [2025-02-08 13:35:39,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:35:39,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139619851] [2025-02-08 13:35:39,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 13:35:39,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:35:39,694 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 215 statements into 16 equivalence classes. [2025-02-08 13:35:39,710 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 96 of 215 statements. [2025-02-08 13:35:39,711 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 13:35:39,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:39,893 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-02-08 13:35:39,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:35:39,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139619851] [2025-02-08 13:35:39,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139619851] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:35:39,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:35:39,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 13:35:39,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210796427] [2025-02-08 13:35:39,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:35:39,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:35:39,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:35:39,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:35:39,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:35:39,895 INFO L87 Difference]: Start difference. First operand 630 states and 826 transitions. Second operand has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:35:40,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:35:40,336 INFO L93 Difference]: Finished difference Result 1215 states and 1605 transitions. [2025-02-08 13:35:40,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 13:35:40,337 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 215 [2025-02-08 13:35:40,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:35:40,339 INFO L225 Difference]: With dead ends: 1215 [2025-02-08 13:35:40,339 INFO L226 Difference]: Without dead ends: 640 [2025-02-08 13:35:40,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 13:35:40,340 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 8 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1812 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 13:35:40,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1812 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 13:35:40,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2025-02-08 13:35:40,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 630. [2025-02-08 13:35:40,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 612 states have (on average 1.303921568627451) internal successors, (798), 615 states have internal predecessors, (798), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2025-02-08 13:35:40,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 826 transitions. [2025-02-08 13:35:40,353 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 826 transitions. Word has length 215 [2025-02-08 13:35:40,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:35:40,353 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 826 transitions. [2025-02-08 13:35:40,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:35:40,353 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 826 transitions. [2025-02-08 13:35:40,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-02-08 13:35:40,354 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:35:40,354 INFO L218 NwaCegarLoop]: trace histogram [24, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:35:40,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 13:35:40,354 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:35:40,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:35:40,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1487637622, now seen corresponding path program 1 times [2025-02-08 13:35:40,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:35:40,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840506980] [2025-02-08 13:35:40,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:40,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:35:40,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-08 13:35:40,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-08 13:35:40,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:40,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:40,839 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-02-08 13:35:40,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:35:40,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840506980] [2025-02-08 13:35:40,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840506980] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:35:40,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:35:40,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 13:35:40,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369290715] [2025-02-08 13:35:40,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:35:40,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 13:35:40,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:35:40,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 13:35:40,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 13:35:40,841 INFO L87 Difference]: Start difference. First operand 630 states and 826 transitions. Second operand has 9 states, 9 states have (on average 19.555555555555557) internal successors, (176), 9 states have internal predecessors, (176), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:35:41,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:35:41,322 INFO L93 Difference]: Finished difference Result 1220 states and 1609 transitions. [2025-02-08 13:35:41,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 13:35:41,322 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.555555555555557) internal successors, (176), 9 states have internal predecessors, (176), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 216 [2025-02-08 13:35:41,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:35:41,327 INFO L225 Difference]: With dead ends: 1220 [2025-02-08 13:35:41,327 INFO L226 Difference]: Without dead ends: 650 [2025-02-08 13:35:41,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 13:35:41,329 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 16 mSDsluCounter, 2103 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2451 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 13:35:41,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2451 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 13:35:41,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2025-02-08 13:35:41,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 644. [2025-02-08 13:35:41,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 626 states have (on average 1.3035143769968052) internal successors, (816), 629 states have internal predecessors, (816), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2025-02-08 13:35:41,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 844 transitions. [2025-02-08 13:35:41,343 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 844 transitions. Word has length 216 [2025-02-08 13:35:41,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:35:41,343 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 844 transitions. [2025-02-08 13:35:41,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.555555555555557) internal successors, (176), 9 states have internal predecessors, (176), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:35:41,343 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 844 transitions. [2025-02-08 13:35:41,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-02-08 13:35:41,344 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:35:41,344 INFO L218 NwaCegarLoop]: trace histogram [24, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:35:41,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 13:35:41,344 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:35:41,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:35:41,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1648321943, now seen corresponding path program 1 times [2025-02-08 13:35:41,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:35:41,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67586299] [2025-02-08 13:35:41,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:41,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:35:41,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-08 13:35:41,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-08 13:35:41,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:41,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:42,618 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 5 proven. 248 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-08 13:35:42,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:35:42,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67586299] [2025-02-08 13:35:42,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67586299] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:35:42,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137283903] [2025-02-08 13:35:42,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:42,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:35:42,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:35:42,621 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:35:42,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 13:35:43,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-08 13:35:43,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-08 13:35:43,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:43,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:43,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 1399 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 13:35:43,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:35:43,627 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-02-08 13:35:43,627 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:35:43,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137283903] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:35:43,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:35:43,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 20 [2025-02-08 13:35:43,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912185896] [2025-02-08 13:35:43,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:35:43,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 13:35:43,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:35:43,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 13:35:43,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2025-02-08 13:35:43,631 INFO L87 Difference]: Start difference. First operand 644 states and 844 transitions. Second operand has 8 states, 8 states have (on average 22.0) internal successors, (176), 8 states have internal predecessors, (176), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:35:44,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:35:44,179 INFO L93 Difference]: Finished difference Result 1241 states and 1636 transitions. [2025-02-08 13:35:44,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 13:35:44,179 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.0) internal successors, (176), 8 states have internal predecessors, (176), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 216 [2025-02-08 13:35:44,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:35:44,182 INFO L225 Difference]: With dead ends: 1241 [2025-02-08 13:35:44,182 INFO L226 Difference]: Without dead ends: 664 [2025-02-08 13:35:44,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2025-02-08 13:35:44,183 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 31 mSDsluCounter, 1781 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2134 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 13:35:44,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 2134 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 13:35:44,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-02-08 13:35:44,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 654. [2025-02-08 13:35:44,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 636 states have (on average 1.3018867924528301) internal successors, (828), 639 states have internal predecessors, (828), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2025-02-08 13:35:44,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 856 transitions. [2025-02-08 13:35:44,194 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 856 transitions. Word has length 216 [2025-02-08 13:35:44,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:35:44,194 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 856 transitions. [2025-02-08 13:35:44,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.0) internal successors, (176), 8 states have internal predecessors, (176), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:35:44,194 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 856 transitions. [2025-02-08 13:35:44,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-02-08 13:35:44,195 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:35:44,195 INFO L218 NwaCegarLoop]: trace histogram [24, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:35:44,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 13:35:44,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:35:44,396 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:35:44,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:35:44,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1104649172, now seen corresponding path program 1 times [2025-02-08 13:35:44,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:35:44,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984886008] [2025-02-08 13:35:44,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:44,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:35:44,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-02-08 13:35:44,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-02-08 13:35:44,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:44,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:45,033 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-02-08 13:35:45,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:35:45,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984886008] [2025-02-08 13:35:45,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984886008] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:35:45,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:35:45,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 13:35:45,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275963828] [2025-02-08 13:35:45,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:35:45,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 13:35:45,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:35:45,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 13:35:45,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-08 13:35:45,036 INFO L87 Difference]: Start difference. First operand 654 states and 856 transitions. Second operand has 10 states, 10 states have (on average 17.7) internal successors, (177), 10 states have internal predecessors, (177), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:35:45,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:35:45,463 INFO L93 Difference]: Finished difference Result 1259 states and 1660 transitions. [2025-02-08 13:35:45,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 13:35:45,463 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.7) internal successors, (177), 10 states have internal predecessors, (177), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 217 [2025-02-08 13:35:45,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:35:45,466 INFO L225 Difference]: With dead ends: 1259 [2025-02-08 13:35:45,466 INFO L226 Difference]: Without dead ends: 672 [2025-02-08 13:35:45,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 13:35:45,467 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 22 mSDsluCounter, 1814 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 2168 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 13:35:45,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 2168 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 13:35:45,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-02-08 13:35:45,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 660. [2025-02-08 13:35:45,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 642 states have (on average 1.2990654205607477) internal successors, (834), 645 states have internal predecessors, (834), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2025-02-08 13:35:45,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 862 transitions. [2025-02-08 13:35:45,480 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 862 transitions. Word has length 217 [2025-02-08 13:35:45,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:35:45,480 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 862 transitions. [2025-02-08 13:35:45,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.7) internal successors, (177), 10 states have internal predecessors, (177), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:35:45,481 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 862 transitions. [2025-02-08 13:35:45,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-02-08 13:35:45,482 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:35:45,482 INFO L218 NwaCegarLoop]: trace histogram [24, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:35:45,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 13:35:45,482 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:35:45,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:35:45,482 INFO L85 PathProgramCache]: Analyzing trace with hash 464852121, now seen corresponding path program 1 times [2025-02-08 13:35:45,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:35:45,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30819871] [2025-02-08 13:35:45,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:45,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:35:45,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-02-08 13:35:45,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-02-08 13:35:45,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:45,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:46,544 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 5 proven. 248 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-08 13:35:46,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:35:46,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30819871] [2025-02-08 13:35:46,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30819871] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:35:46,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481284508] [2025-02-08 13:35:46,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:35:46,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:35:46,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:35:46,546 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:35:46,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 13:35:47,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-02-08 13:35:47,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-02-08 13:35:47,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:35:47,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:47,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 1400 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-08 13:35:47,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:35:48,208 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 216 proven. 88 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-02-08 13:35:48,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:35:48,412 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 40 proven. 49 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-08 13:35:48,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481284508] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:35:48,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:35:48,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 6] total 31 [2025-02-08 13:35:48,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507220220] [2025-02-08 13:35:48,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:35:48,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-08 13:35:48,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:35:48,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-08 13:35:48,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=764, Unknown=0, NotChecked=0, Total=930 [2025-02-08 13:35:48,414 INFO L87 Difference]: Start difference. First operand 660 states and 862 transitions. Second operand has 31 states, 31 states have (on average 9.064516129032258) internal successors, (281), 31 states have internal predecessors, (281), 3 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-08 13:35:49,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:35:49,248 INFO L93 Difference]: Finished difference Result 1228 states and 1636 transitions. [2025-02-08 13:35:49,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-08 13:35:49,248 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 9.064516129032258) internal successors, (281), 31 states have internal predecessors, (281), 3 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 217 [2025-02-08 13:35:49,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:35:49,250 INFO L225 Difference]: With dead ends: 1228 [2025-02-08 13:35:49,251 INFO L226 Difference]: Without dead ends: 674 [2025-02-08 13:35:49,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=345, Invalid=1547, Unknown=0, NotChecked=0, Total=1892 [2025-02-08 13:35:49,252 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 309 mSDsluCounter, 2466 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 2821 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 13:35:49,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 2821 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 13:35:49,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2025-02-08 13:35:49,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 670. [2025-02-08 13:35:49,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 652 states have (on average 1.3052147239263803) internal successors, (851), 655 states have internal predecessors, (851), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2025-02-08 13:35:49,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 879 transitions. [2025-02-08 13:35:49,269 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 879 transitions. Word has length 217 [2025-02-08 13:35:49,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:35:49,272 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 879 transitions. [2025-02-08 13:35:49,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 9.064516129032258) internal successors, (281), 31 states have internal predecessors, (281), 3 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-08 13:35:49,272 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 879 transitions. [2025-02-08 13:35:49,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-02-08 13:35:49,273 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:35:49,273 INFO L218 NwaCegarLoop]: trace histogram [50, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:35:49,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 13:35:49,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:35:49,474 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:35:49,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:35:49,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1873452729, now seen corresponding path program 2 times [2025-02-08 13:35:49,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:35:49,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496147188] [2025-02-08 13:35:49,475 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:35:49,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:35:49,545 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 243 statements into 2 equivalence classes. [2025-02-08 13:35:50,250 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 243 of 243 statements. [2025-02-08 13:35:50,251 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:35:50,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:51,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1454 backedges. 5 proven. 576 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2025-02-08 13:35:51,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:35:51,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496147188] [2025-02-08 13:35:51,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496147188] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:35:51,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137332911] [2025-02-08 13:35:51,018 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:35:51,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:35:51,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:35:51,024 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:35:51,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 13:35:51,615 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 243 statements into 2 equivalence classes. [2025-02-08 13:35:53,201 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 243 of 243 statements. [2025-02-08 13:35:53,201 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:35:53,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:35:53,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 1790 conjuncts, 230 conjuncts are in the unsatisfiable core [2025-02-08 13:35:53,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:35:53,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 13:35:53,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 13:35:53,376 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2025-02-08 13:35:53,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 33 [2025-02-08 13:35:53,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 13:35:53,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-08 13:35:53,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-08 13:35:53,731 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 13:35:53,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-08 13:35:53,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-08 13:35:57,577 INFO L224 Elim1Store]: Index analysis took 128 ms