./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-1.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 fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:10:41,094 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:10:41,152 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 18:10:41,158 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:10:41,161 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:10:41,184 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:10:41,184 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:10:41,184 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:10:41,184 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:10:41,186 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:10:41,187 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:10:41,187 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:10:41,187 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:10:41,187 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:10:41,188 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:10:41,188 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:10:41,188 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:10:41,188 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 18:10:41,188 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:10:41,188 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 18:10:41,188 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:10:41,188 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:10:41,188 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:10:41,188 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:10:41,189 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:10:41,189 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:10:41,189 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 18:10:41,189 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:10:41,189 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:10:41,189 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:10:41,189 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:10:41,189 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:10:41,190 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:10:41,190 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:10:41,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:10:41,190 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:10:41,190 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:10:41,190 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:10:41,190 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:10:41,190 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:10:41,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:10:41,190 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:10:41,190 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:10:41,190 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:10:41,191 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:10:41,191 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 -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2025-02-06 18:10:41,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:10:41,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:10:41,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:10:41,446 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:10:41,446 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:10:41,448 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_FNV_nondet_test1-1.i [2025-02-06 18:10:42,693 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0684557bb/b27feb2853094060b72ff681cbc9d34e/FLAG70f25beae [2025-02-06 18:10:43,075 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:10:43,076 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-1.i [2025-02-06 18:10:43,094 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0684557bb/b27feb2853094060b72ff681cbc9d34e/FLAG70f25beae [2025-02-06 18:10:43,110 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0684557bb/b27feb2853094060b72ff681cbc9d34e [2025-02-06 18:10:43,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:10:43,114 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:10:43,115 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:10:43,115 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:10:43,118 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:10:43,119 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:10:43" (1/1) ... [2025-02-06 18:10:43,120 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d0db051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:10:43, skipping insertion in model container [2025-02-06 18:10:43,120 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:10:43" (1/1) ... [2025-02-06 18:10:43,150 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:10:43,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:10:43,404 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:10:43,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:10:43,483 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:10:43,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:10:43 WrapperNode [2025-02-06 18:10:43,484 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:10:43,485 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:10:43,485 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:10:43,485 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:10:43,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:10:43" (1/1) ... [2025-02-06 18:10:43,503 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:10:43" (1/1) ... [2025-02-06 18:10:43,532 INFO L138 Inliner]: procedures = 176, calls = 170, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 779 [2025-02-06 18:10:43,532 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:10:43,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:10:43,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:10:43,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:10:43,539 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:10:43" (1/1) ... [2025-02-06 18:10:43,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:10:43" (1/1) ... [2025-02-06 18:10:43,545 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:10:43" (1/1) ... [2025-02-06 18:10:43,580 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [156, 2]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2]. The 42 writes are split as follows [42, 0]. [2025-02-06 18:10:43,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:10:43" (1/1) ... [2025-02-06 18:10:43,581 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:10:43" (1/1) ... [2025-02-06 18:10:43,596 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:10:43" (1/1) ... [2025-02-06 18:10:43,598 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:10:43" (1/1) ... [2025-02-06 18:10:43,600 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:10:43" (1/1) ... [2025-02-06 18:10:43,601 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:10:43" (1/1) ... [2025-02-06 18:10:43,604 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:10:43,605 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:10:43,605 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:10:43,605 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:10:43,606 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:10:43" (1/1) ... [2025-02-06 18:10:43,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:10:43,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:10:43,627 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 18:10:43,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 18:10:43,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 18:10:43,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 18:10:43,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 18:10:43,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 18:10:43,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 18:10:43,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 18:10:43,653 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 18:10:43,653 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 18:10:43,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 18:10:43,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:10:43,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 18:10:43,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 18:10:43,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 18:10:43,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 18:10:43,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 18:10:43,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 18:10:43,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 18:10:43,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:10:43,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:10:43,775 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:10:43,776 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:10:44,500 INFO L? ?]: Removed 205 outVars from TransFormulas that were not future-live. [2025-02-06 18:10:44,500 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:10:44,522 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:10:44,523 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 18:10:44,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:10:44 BoogieIcfgContainer [2025-02-06 18:10:44,523 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:10:44,525 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:10:44,525 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:10:44,528 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:10:44,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:10:43" (1/3) ... [2025-02-06 18:10:44,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28f58618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:10:44, skipping insertion in model container [2025-02-06 18:10:44,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:10:43" (2/3) ... [2025-02-06 18:10:44,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28f58618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:10:44, skipping insertion in model container [2025-02-06 18:10:44,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:10:44" (3/3) ... [2025-02-06 18:10:44,530 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test1-1.i [2025-02-06 18:10:44,540 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:10:44,541 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_nondet_test1-1.i that has 3 procedures, 222 locations, 1 initial locations, 20 loop locations, and 6 error locations. [2025-02-06 18:10:44,574 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:10:44,581 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;@771b3b75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:10:44,582 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 18:10:44,585 INFO L276 IsEmpty]: Start isEmpty. Operand has 218 states, 207 states have (on average 1.608695652173913) internal successors, (333), 213 states have internal predecessors, (333), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 18:10:44,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 18:10:44,588 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:10:44,588 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 18:10:44,588 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:10:44,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:10:44,592 INFO L85 PathProgramCache]: Analyzing trace with hash 374673429, now seen corresponding path program 1 times [2025-02-06 18:10:44,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:10:44,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901107948] [2025-02-06 18:10:44,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:10:44,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:10:44,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 18:10:44,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 18:10:44,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:10:44,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:10:44,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:10:44,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:10:44,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901107948] [2025-02-06 18:10:44,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901107948] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:10:44,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:10:44,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:10:44,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935760559] [2025-02-06 18:10:44,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:10:44,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:10:44,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:10:44,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:10:44,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:10:44,736 INFO L87 Difference]: Start difference. First operand has 218 states, 207 states have (on average 1.608695652173913) internal successors, (333), 213 states have internal predecessors, (333), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:10:44,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:10:44,909 INFO L93 Difference]: Finished difference Result 629 states and 990 transitions. [2025-02-06 18:10:44,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:10:44,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-02-06 18:10:44,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:10:44,921 INFO L225 Difference]: With dead ends: 629 [2025-02-06 18:10:44,921 INFO L226 Difference]: Without dead ends: 407 [2025-02-06 18:10:44,923 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-06 18:10:44,925 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 276 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:10:44,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 595 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:10:44,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-02-06 18:10:44,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 212. [2025-02-06 18:10:44,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 202 states have (on average 1.4554455445544554) internal successors, (294), 207 states have internal predecessors, (294), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 18:10:44,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 300 transitions. [2025-02-06 18:10:44,959 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 300 transitions. Word has length 5 [2025-02-06 18:10:44,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:10:44,959 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 300 transitions. [2025-02-06 18:10:44,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:10:44,959 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 300 transitions. [2025-02-06 18:10:44,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 18:10:44,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:10:44,960 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 18:10:44,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:10:44,960 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:10:44,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:10:44,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1259589826, now seen corresponding path program 1 times [2025-02-06 18:10:44,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:10:44,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493283001] [2025-02-06 18:10:44,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:10:44,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:10:44,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 18:10:44,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 18:10:44,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:10:44,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:10:45,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:10:45,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:10:45,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493283001] [2025-02-06 18:10:45,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493283001] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:10:45,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:10:45,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:10:45,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731267560] [2025-02-06 18:10:45,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:10:45,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:10:45,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:10:45,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:10:45,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:10:45,127 INFO L87 Difference]: Start difference. First operand 212 states and 300 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-06 18:10:45,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:10:45,194 INFO L93 Difference]: Finished difference Result 217 states and 306 transitions. [2025-02-06 18:10:45,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:10:45,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-06 18:10:45,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:10:45,196 INFO L225 Difference]: With dead ends: 217 [2025-02-06 18:10:45,197 INFO L226 Difference]: Without dead ends: 216 [2025-02-06 18:10:45,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:10:45,197 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 2 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:10:45,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 544 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:10:45,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-02-06 18:10:45,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2025-02-06 18:10:45,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 205 states have (on average 1.448780487804878) internal successors, (297), 210 states have internal predecessors, (297), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 18:10:45,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 303 transitions. [2025-02-06 18:10:45,209 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 303 transitions. Word has length 6 [2025-02-06 18:10:45,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:10:45,210 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 303 transitions. [2025-02-06 18:10:45,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-06 18:10:45,210 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 303 transitions. [2025-02-06 18:10:45,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 18:10:45,210 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:10:45,210 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:10:45,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 18:10:45,210 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:10:45,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:10:45,210 INFO L85 PathProgramCache]: Analyzing trace with hash -392578618, now seen corresponding path program 1 times [2025-02-06 18:10:45,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:10:45,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733452899] [2025-02-06 18:10:45,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:10:45,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:10:45,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:10:45,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:10:45,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:10:45,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:10:45,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:10:45,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:10:45,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733452899] [2025-02-06 18:10:45,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733452899] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:10:45,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:10:45,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:10:45,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697689462] [2025-02-06 18:10:45,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:10:45,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:10:45,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:10:45,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:10:45,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:10:45,321 INFO L87 Difference]: Start difference. First operand 215 states and 303 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:10:45,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:10:45,436 INFO L93 Difference]: Finished difference Result 217 states and 305 transitions. [2025-02-06 18:10:45,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:10:45,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 18:10:45,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:10:45,438 INFO L225 Difference]: With dead ends: 217 [2025-02-06 18:10:45,438 INFO L226 Difference]: Without dead ends: 216 [2025-02-06 18:10:45,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:10:45,438 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 0 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:10:45,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 545 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:10:45,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-02-06 18:10:45,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2025-02-06 18:10:45,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 206 states have (on average 1.4466019417475728) internal successors, (298), 211 states have internal predecessors, (298), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 18:10:45,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 304 transitions. [2025-02-06 18:10:45,453 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 304 transitions. Word has length 7 [2025-02-06 18:10:45,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:10:45,453 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 304 transitions. [2025-02-06 18:10:45,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:10:45,453 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 304 transitions. [2025-02-06 18:10:45,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-06 18:10:45,456 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:10:45,456 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] [2025-02-06 18:10:45,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:10:45,457 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:10:45,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:10:45,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1815032011, now seen corresponding path program 1 times [2025-02-06 18:10:45,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:10:45,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024685423] [2025-02-06 18:10:45,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:10:45,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:10:45,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-06 18:10:45,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-06 18:10:45,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:10:45,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:10:45,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:10:45,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:10:45,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024685423] [2025-02-06 18:10:45,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024685423] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:10:45,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:10:45,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:10:45,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453432184] [2025-02-06 18:10:45,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:10:45,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:10:45,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:10:45,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:10:45,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:10:45,681 INFO L87 Difference]: Start difference. First operand 216 states and 304 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:10:45,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:10:45,843 INFO L93 Difference]: Finished difference Result 428 states and 604 transitions. [2025-02-06 18:10:45,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:10:45,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 79 [2025-02-06 18:10:45,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:10:45,845 INFO L225 Difference]: With dead ends: 428 [2025-02-06 18:10:45,845 INFO L226 Difference]: Without dead ends: 219 [2025-02-06 18:10:45,845 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-06 18:10:45,846 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 105 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:10:45,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 666 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:10:45,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-02-06 18:10:45,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2025-02-06 18:10:45,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 206 states have (on average 1.412621359223301) internal successors, (291), 211 states have internal predecessors, (291), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 18:10:45,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 297 transitions. [2025-02-06 18:10:45,860 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 297 transitions. Word has length 79 [2025-02-06 18:10:45,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:10:45,861 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 297 transitions. [2025-02-06 18:10:45,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:10:45,861 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 297 transitions. [2025-02-06 18:10:45,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-06 18:10:45,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:10:45,864 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] [2025-02-06 18:10:45,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 18:10:45,864 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:10:45,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:10:45,865 INFO L85 PathProgramCache]: Analyzing trace with hash -687508369, now seen corresponding path program 1 times [2025-02-06 18:10:45,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:10:45,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147801863] [2025-02-06 18:10:45,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:10:45,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:10:45,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-06 18:10:45,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-06 18:10:45,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:10:45,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:10:46,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:10:46,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:10:46,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147801863] [2025-02-06 18:10:46,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147801863] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:10:46,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:10:46,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:10:46,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264809511] [2025-02-06 18:10:46,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:10:46,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:10:46,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:10:46,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:10:46,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:10:46,010 INFO L87 Difference]: Start difference. First operand 216 states and 297 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:10:46,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:10:46,083 INFO L93 Difference]: Finished difference Result 551 states and 773 transitions. [2025-02-06 18:10:46,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:10:46,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 79 [2025-02-06 18:10:46,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:10:46,086 INFO L225 Difference]: With dead ends: 551 [2025-02-06 18:10:46,086 INFO L226 Difference]: Without dead ends: 342 [2025-02-06 18:10:46,086 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-06 18:10:46,087 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 134 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:10:46,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 530 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:10:46,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-02-06 18:10:46,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2025-02-06 18:10:46,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 332 states have (on average 1.4337349397590362) internal successors, (476), 337 states have internal predecessors, (476), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 18:10:46,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 482 transitions. [2025-02-06 18:10:46,102 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 482 transitions. Word has length 79 [2025-02-06 18:10:46,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:10:46,102 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 482 transitions. [2025-02-06 18:10:46,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:10:46,102 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 482 transitions. [2025-02-06 18:10:46,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 18:10:46,107 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:10:46,108 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] [2025-02-06 18:10:46,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 18:10:46,108 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:10:46,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:10:46,108 INFO L85 PathProgramCache]: Analyzing trace with hash 984611330, now seen corresponding path program 1 times [2025-02-06 18:10:46,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:10:46,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180847134] [2025-02-06 18:10:46,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:10:46,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:10:46,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 18:10:46,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 18:10:46,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:10:46,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:10:46,464 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-06 18:10:46,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:10:46,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180847134] [2025-02-06 18:10:46,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180847134] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:10:46,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:10:46,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:10:46,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297500606] [2025-02-06 18:10:46,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:10:46,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:10:46,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:10:46,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:10:46,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:10:46,469 INFO L87 Difference]: Start difference. First operand 342 states and 482 transitions. Second operand has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:10:46,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:10:46,580 INFO L93 Difference]: Finished difference Result 407 states and 567 transitions. [2025-02-06 18:10:46,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:10:46,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 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 94 [2025-02-06 18:10:46,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:10:46,583 INFO L225 Difference]: With dead ends: 407 [2025-02-06 18:10:46,585 INFO L226 Difference]: Without dead ends: 405 [2025-02-06 18:10:46,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:10:46,585 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 185 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:10:46,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 868 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:10:46,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-02-06 18:10:46,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2025-02-06 18:10:46,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 392 states have (on average 1.4107142857142858) internal successors, (553), 397 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-06 18:10:46,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 565 transitions. [2025-02-06 18:10:46,601 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 565 transitions. Word has length 94 [2025-02-06 18:10:46,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:10:46,601 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 565 transitions. [2025-02-06 18:10:46,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:10:46,603 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 565 transitions. [2025-02-06 18:10:46,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-06 18:10:46,604 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:10:46,604 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] [2025-02-06 18:10:46,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:10:46,604 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:10:46,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:10:46,604 INFO L85 PathProgramCache]: Analyzing trace with hash 238803775, now seen corresponding path program 1 times [2025-02-06 18:10:46,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:10:46,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551055636] [2025-02-06 18:10:46,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:10:46,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:10:46,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 18:10:46,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 18:10:46,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:10:46,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:10:46,832 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:10:46,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:10:46,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551055636] [2025-02-06 18:10:46,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551055636] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:10:46,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235110766] [2025-02-06 18:10:46,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:10:46,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:10:46,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:10:46,837 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:10:46,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 18:10:46,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 18:10:47,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 18:10:47,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:10:47,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:10:47,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 18:10:47,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:10:47,216 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:10:47,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:10:47,365 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:10:47,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235110766] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:10:47,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:10:47,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 18:10:47,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299063900] [2025-02-06 18:10:47,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:10:47,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 18:10:47,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:10:47,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 18:10:47,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 18:10:47,367 INFO L87 Difference]: Start difference. First operand 405 states and 565 transitions. Second operand has 10 states, 10 states have (on average 26.0) internal successors, (260), 10 states have internal predecessors, (260), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 18:10:47,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:10:47,553 INFO L93 Difference]: Finished difference Result 610 states and 853 transitions. [2025-02-06 18:10:47,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 18:10:47,553 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 26.0) internal successors, (260), 10 states have internal predecessors, (260), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 98 [2025-02-06 18:10:47,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:10:47,557 INFO L225 Difference]: With dead ends: 610 [2025-02-06 18:10:47,557 INFO L226 Difference]: Without dead ends: 604 [2025-02-06 18:10:47,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 18:10:47,558 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 1054 mSDsluCounter, 1408 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 1711 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:10:47,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1061 Valid, 1711 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:10:47,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-02-06 18:10:47,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 602. [2025-02-06 18:10:47,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 586 states have (on average 1.4112627986348123) internal successors, (827), 591 states have internal predecessors, (827), 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-06 18:10:47,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 845 transitions. [2025-02-06 18:10:47,574 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 845 transitions. Word has length 98 [2025-02-06 18:10:47,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:10:47,574 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 845 transitions. [2025-02-06 18:10:47,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 26.0) internal successors, (260), 10 states have internal predecessors, (260), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 18:10:47,575 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 845 transitions. [2025-02-06 18:10:47,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 18:10:47,576 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:10:47,576 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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] [2025-02-06 18:10:47,583 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-06 18:10:47,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:10:47,780 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:10:47,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:10:47,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1176581804, now seen corresponding path program 1 times [2025-02-06 18:10:47,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:10:47,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414965702] [2025-02-06 18:10:47,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:10:47,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:10:47,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 18:10:47,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 18:10:47,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:10:47,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:10:48,257 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:10:48,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:10:48,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414965702] [2025-02-06 18:10:48,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414965702] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:10:48,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563638446] [2025-02-06 18:10:48,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:10:48,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:10:48,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:10:48,260 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:10:48,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 18:10:48,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 18:10:48,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 18:10:48,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:10:48,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:10:48,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 18:10:48,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:10:48,647 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:10:48,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:10:48,866 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:10:48,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563638446] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:10:48,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:10:48,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-02-06 18:10:48,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863717032] [2025-02-06 18:10:48,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:10:48,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 18:10:48,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:10:48,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 18:10:48,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-02-06 18:10:48,869 INFO L87 Difference]: Start difference. First operand 602 states and 845 transitions. Second operand has 13 states, 12 states have (on average 15.666666666666666) internal successors, (188), 13 states have internal predecessors, (188), 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-06 18:10:49,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:10:49,102 INFO L93 Difference]: Finished difference Result 809 states and 1137 transitions. [2025-02-06 18:10:49,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 18:10:49,103 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 15.666666666666666) internal successors, (188), 13 states have internal predecessors, (188), 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 99 [2025-02-06 18:10:49,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:10:49,106 INFO L225 Difference]: With dead ends: 809 [2025-02-06 18:10:49,106 INFO L226 Difference]: Without dead ends: 808 [2025-02-06 18:10:49,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-02-06 18:10:49,108 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 1128 mSDsluCounter, 1711 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1133 SdHoareTripleChecker+Valid, 2052 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:10:49,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1133 Valid, 2052 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:10:49,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2025-02-06 18:10:49,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 801. [2025-02-06 18:10:49,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 782 states have (on average 1.4104859335038362) internal successors, (1103), 787 states have internal predecessors, (1103), 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-06 18:10:49,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1127 transitions. [2025-02-06 18:10:49,138 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1127 transitions. Word has length 99 [2025-02-06 18:10:49,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:10:49,139 INFO L471 AbstractCegarLoop]: Abstraction has 801 states and 1127 transitions. [2025-02-06 18:10:49,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 15.666666666666666) internal successors, (188), 13 states have internal predecessors, (188), 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-06 18:10:49,139 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1127 transitions. [2025-02-06 18:10:49,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 18:10:49,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:10:49,141 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2025-02-06 18:10:49,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 18:10:49,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:10:49,342 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:10:49,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:10:49,342 INFO L85 PathProgramCache]: Analyzing trace with hash -2114297232, now seen corresponding path program 1 times [2025-02-06 18:10:49,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:10:49,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403963927] [2025-02-06 18:10:49,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:10:49,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:10:49,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 18:10:49,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 18:10:49,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:10:49,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:10:49,749 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:10:49,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:10:49,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403963927] [2025-02-06 18:10:49,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403963927] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:10:49,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35135425] [2025-02-06 18:10:49,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:10:49,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:10:49,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:10:49,752 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:10:49,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 18:10:49,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 18:10:49,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 18:10:49,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:10:49,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:10:49,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 18:10:49,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:10:50,091 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:10:50,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:10:50,214 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:10:50,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35135425] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:10:50,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:10:50,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-02-06 18:10:50,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381909667] [2025-02-06 18:10:50,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:10:50,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 18:10:50,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:10:50,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 18:10:50,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-02-06 18:10:50,216 INFO L87 Difference]: Start difference. First operand 801 states and 1127 transitions. Second operand has 13 states, 12 states have (on average 15.916666666666666) internal successors, (191), 13 states have internal predecessors, (191), 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-06 18:10:50,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:10:50,428 INFO L93 Difference]: Finished difference Result 809 states and 1134 transitions. [2025-02-06 18:10:50,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 18:10:50,428 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 15.916666666666666) internal successors, (191), 13 states have internal predecessors, (191), 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 100 [2025-02-06 18:10:50,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:10:50,431 INFO L225 Difference]: With dead ends: 809 [2025-02-06 18:10:50,431 INFO L226 Difference]: Without dead ends: 808 [2025-02-06 18:10:50,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-02-06 18:10:50,432 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 830 mSDsluCounter, 1800 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 2064 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:10:50,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 2064 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:10:50,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2025-02-06 18:10:50,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 802. [2025-02-06 18:10:50,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 783 states have (on average 1.4074074074074074) internal successors, (1102), 788 states have internal predecessors, (1102), 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-06 18:10:50,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1126 transitions. [2025-02-06 18:10:50,448 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1126 transitions. Word has length 100 [2025-02-06 18:10:50,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:10:50,448 INFO L471 AbstractCegarLoop]: Abstraction has 802 states and 1126 transitions. [2025-02-06 18:10:50,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 15.916666666666666) internal successors, (191), 13 states have internal predecessors, (191), 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-06 18:10:50,449 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1126 transitions. [2025-02-06 18:10:50,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-06 18:10:50,450 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:10:50,450 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:10:50,461 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-06 18:10:50,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:10:50,651 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:10:50,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:10:50,652 INFO L85 PathProgramCache]: Analyzing trace with hash 233145113, now seen corresponding path program 1 times [2025-02-06 18:10:50,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:10:50,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46628139] [2025-02-06 18:10:50,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:10:50,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:10:50,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-06 18:10:50,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-06 18:10:50,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:10:50,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:10:50,926 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:10:50,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:10:50,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46628139] [2025-02-06 18:10:50,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46628139] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:10:50,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786269792] [2025-02-06 18:10:50,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:10:50,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:10:50,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:10:50,928 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:10:50,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 18:10:51,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-06 18:10:51,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-06 18:10:51,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:10:51,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:10:51,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 18:10:51,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:10:51,374 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:10:51,374 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:10:51,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786269792] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:10:51,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:10:51,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-06 18:10:51,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342840934] [2025-02-06 18:10:51,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:10:51,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:10:51,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:10:51,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:10:51,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:10:51,376 INFO L87 Difference]: Start difference. First operand 802 states and 1126 transitions. Second operand has 6 states, 5 states have (on average 33.0) internal successors, (165), 6 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:10:51,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:10:51,478 INFO L93 Difference]: Finished difference Result 802 states and 1126 transitions. [2025-02-06 18:10:51,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:10:51,479 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 33.0) internal successors, (165), 6 states have internal predecessors, (165), 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 172 [2025-02-06 18:10:51,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:10:51,482 INFO L225 Difference]: With dead ends: 802 [2025-02-06 18:10:51,482 INFO L226 Difference]: Without dead ends: 801 [2025-02-06 18:10:51,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:10:51,482 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 379 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:10:51,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1209 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:10:51,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2025-02-06 18:10:51,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2025-02-06 18:10:51,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 783 states have (on average 1.4035759897828863) internal successors, (1099), 787 states have internal predecessors, (1099), 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-06 18:10:51,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1123 transitions. [2025-02-06 18:10:51,504 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1123 transitions. Word has length 172 [2025-02-06 18:10:51,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:10:51,504 INFO L471 AbstractCegarLoop]: Abstraction has 801 states and 1123 transitions. [2025-02-06 18:10:51,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 33.0) internal successors, (165), 6 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:10:51,505 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1123 transitions. [2025-02-06 18:10:51,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-02-06 18:10:51,509 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:10:51,509 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:10:51,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 18:10:51,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 18:10:51,710 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:10:51,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:10:51,711 INFO L85 PathProgramCache]: Analyzing trace with hash -984064503, now seen corresponding path program 1 times [2025-02-06 18:10:51,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:10:51,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293704398] [2025-02-06 18:10:51,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:10:51,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:10:51,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-02-06 18:10:51,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-02-06 18:10:51,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:10:51,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:10:51,991 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-06 18:10:51,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:10:51,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293704398] [2025-02-06 18:10:51,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293704398] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:10:51,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:10:51,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:10:51,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028515703] [2025-02-06 18:10:51,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:10:51,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:10:51,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:10:51,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:10:51,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:10:51,993 INFO L87 Difference]: Start difference. First operand 801 states and 1123 transitions. Second operand has 4 states, 3 states have (on average 56.333333333333336) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:10:52,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:10:52,040 INFO L93 Difference]: Finished difference Result 801 states and 1123 transitions. [2025-02-06 18:10:52,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:10:52,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 56.333333333333336) internal successors, (169), 4 states have internal predecessors, (169), 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 251 [2025-02-06 18:10:52,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:10:52,043 INFO L225 Difference]: With dead ends: 801 [2025-02-06 18:10:52,043 INFO L226 Difference]: Without dead ends: 800 [2025-02-06 18:10:52,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:10:52,044 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 194 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:10:52,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 538 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:10:52,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-02-06 18:10:52,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 800. [2025-02-06 18:10:52,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 783 states have (on average 1.4010217113665389) internal successors, (1097), 786 states have internal predecessors, (1097), 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-06 18:10:52,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1121 transitions. [2025-02-06 18:10:52,064 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1121 transitions. Word has length 251 [2025-02-06 18:10:52,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:10:52,065 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1121 transitions. [2025-02-06 18:10:52,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 56.333333333333336) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:10:52,065 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1121 transitions. [2025-02-06 18:10:52,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-02-06 18:10:52,068 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:10:52,069 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:10:52,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 18:10:52,069 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:10:52,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:10:52,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1181145645, now seen corresponding path program 1 times [2025-02-06 18:10:52,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:10:52,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771444383] [2025-02-06 18:10:52,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:10:52,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:10:52,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-02-06 18:10:52,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-02-06 18:10:52,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:10:52,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:10:52,587 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 233 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:10:52,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:10:52,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771444383] [2025-02-06 18:10:52,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771444383] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:10:52,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508491219] [2025-02-06 18:10:52,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:10:52,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:10:52,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:10:52,592 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:10:52,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 18:10:52,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-02-06 18:10:52,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-02-06 18:10:52,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:10:52,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:10:52,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 1306 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 18:10:52,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:10:53,189 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 233 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:10:53,189 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:10:53,459 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 233 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:10:53,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508491219] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:10:53,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:10:53,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-02-06 18:10:53,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297153229] [2025-02-06 18:10:53,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:10:53,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 18:10:53,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:10:53,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 18:10:53,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-02-06 18:10:53,461 INFO L87 Difference]: Start difference. First operand 800 states and 1121 transitions. Second operand has 18 states, 18 states have (on average 31.77777777777778) internal successors, (572), 18 states have internal predecessors, (572), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 18:10:53,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:10:53,808 INFO L93 Difference]: Finished difference Result 1393 states and 1957 transitions. [2025-02-06 18:10:53,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 18:10:53,808 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 31.77777777777778) internal successors, (572), 18 states have internal predecessors, (572), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 254 [2025-02-06 18:10:53,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:10:53,814 INFO L225 Difference]: With dead ends: 1393 [2025-02-06 18:10:53,814 INFO L226 Difference]: Without dead ends: 1388 [2025-02-06 18:10:53,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-02-06 18:10:53,815 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 2271 mSDsluCounter, 3394 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2290 SdHoareTripleChecker+Valid, 3735 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 18:10:53,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2290 Valid, 3735 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 18:10:53,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2025-02-06 18:10:53,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1384. [2025-02-06 18:10:53,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1358 states have (on average 1.4035346097201766) internal successors, (1906), 1361 states have internal predecessors, (1906), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 18:10:53,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1948 transitions. [2025-02-06 18:10:53,843 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1948 transitions. Word has length 254 [2025-02-06 18:10:53,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:10:53,844 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 1948 transitions. [2025-02-06 18:10:53,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 31.77777777777778) internal successors, (572), 18 states have internal predecessors, (572), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 18:10:53,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1948 transitions. [2025-02-06 18:10:53,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-02-06 18:10:53,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:10:53,847 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:10:53,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 18:10:54,047 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,SelfDestructingSolverStorable11 [2025-02-06 18:10:54,048 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:10:54,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:10:54,049 INFO L85 PathProgramCache]: Analyzing trace with hash -454537745, now seen corresponding path program 1 times [2025-02-06 18:10:54,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:10:54,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151770534] [2025-02-06 18:10:54,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:10:54,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:10:54,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-02-06 18:10:54,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-02-06 18:10:54,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:10:54,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:10:55,892 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 478 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:10:55,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:10:55,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151770534] [2025-02-06 18:10:55,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151770534] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:10:55,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073027805] [2025-02-06 18:10:55,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:10:55,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:10:55,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:10:55,897 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:10:55,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 18:10:56,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-02-06 18:10:56,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-02-06 18:10:56,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:10:56,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:10:56,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 1715 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 18:10:56,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:10:56,894 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 478 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:10:56,894 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:10:57,337 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 478 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:10:57,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073027805] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:10:57,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:10:57,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-02-06 18:10:57,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253673459] [2025-02-06 18:10:57,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:10:57,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-06 18:10:57,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:10:57,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-06 18:10:57,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=498, Unknown=0, NotChecked=0, Total=756 [2025-02-06 18:10:57,340 INFO L87 Difference]: Start difference. First operand 1384 states and 1948 transitions. Second operand has 28 states, 27 states have (on average 24.62962962962963) internal successors, (665), 28 states have internal predecessors, (665), 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-06 18:10:57,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:10:57,945 INFO L93 Difference]: Finished difference Result 1986 states and 2806 transitions. [2025-02-06 18:10:57,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 18:10:57,945 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 24.62962962962963) internal successors, (665), 28 states have internal predecessors, (665), 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 333 [2025-02-06 18:10:57,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:10:57,952 INFO L225 Difference]: With dead ends: 1986 [2025-02-06 18:10:57,952 INFO L226 Difference]: Without dead ends: 1985 [2025-02-06 18:10:57,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 680 GetRequests, 649 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=338, Invalid=718, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 18:10:57,954 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 2773 mSDsluCounter, 3336 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2796 SdHoareTripleChecker+Valid, 3675 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 18:10:57,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2796 Valid, 3675 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 18:10:57,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2025-02-06 18:10:58,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1975. [2025-02-06 18:10:58,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1975 states, 1940 states have (on average 1.4036082474226803) internal successors, (2723), 1943 states have internal predecessors, (2723), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 18:10:58,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 2783 transitions. [2025-02-06 18:10:58,061 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 2783 transitions. Word has length 333 [2025-02-06 18:10:58,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:10:58,062 INFO L471 AbstractCegarLoop]: Abstraction has 1975 states and 2783 transitions. [2025-02-06 18:10:58,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 24.62962962962963) internal successors, (665), 28 states have internal predecessors, (665), 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-06 18:10:58,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 2783 transitions. [2025-02-06 18:10:58,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-02-06 18:10:58,067 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:10:58,067 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:10:58,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 18:10:58,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-06 18:10:58,273 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:10:58,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:10:58,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1205767883, now seen corresponding path program 1 times [2025-02-06 18:10:58,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:10:58,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259648644] [2025-02-06 18:10:58,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:10:58,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:10:58,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-02-06 18:10:58,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-02-06 18:10:58,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:10:58,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:10:59,867 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 482 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:10:59,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:10:59,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259648644] [2025-02-06 18:10:59,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259648644] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:10:59,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647063194] [2025-02-06 18:10:59,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:10:59,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:10:59,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:10:59,870 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:10:59,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 18:11:00,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-02-06 18:11:00,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-02-06 18:11:00,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:11:00,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:11:00,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 1716 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 18:11:00,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:11:00,727 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 482 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:11:00,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:11:01,124 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 482 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:11:01,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647063194] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:11:01,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:11:01,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-02-06 18:11:01,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015266850] [2025-02-06 18:11:01,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:11:01,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-06 18:11:01,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:11:01,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-06 18:11:01,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=498, Unknown=0, NotChecked=0, Total=756 [2025-02-06 18:11:01,127 INFO L87 Difference]: Start difference. First operand 1975 states and 2783 transitions. Second operand has 28 states, 27 states have (on average 24.74074074074074) internal successors, (668), 28 states have internal predecessors, (668), 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-06 18:11:01,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:11:01,631 INFO L93 Difference]: Finished difference Result 1986 states and 2800 transitions. [2025-02-06 18:11:01,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 18:11:01,632 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 24.74074074074074) internal successors, (668), 28 states have internal predecessors, (668), 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 334 [2025-02-06 18:11:01,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:11:01,638 INFO L225 Difference]: With dead ends: 1986 [2025-02-06 18:11:01,638 INFO L226 Difference]: Without dead ends: 1985 [2025-02-06 18:11:01,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 651 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=338, Invalid=718, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 18:11:01,639 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 2925 mSDsluCounter, 3939 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2948 SdHoareTripleChecker+Valid, 4279 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 18:11:01,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2948 Valid, 4279 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 18:11:01,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2025-02-06 18:11:01,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1976. [2025-02-06 18:11:01,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1976 states, 1941 states have (on average 1.4008243173621844) internal successors, (2719), 1944 states have internal predecessors, (2719), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 18:11:01,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 2779 transitions. [2025-02-06 18:11:01,670 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 2779 transitions. Word has length 334 [2025-02-06 18:11:01,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:11:01,671 INFO L471 AbstractCegarLoop]: Abstraction has 1976 states and 2779 transitions. [2025-02-06 18:11:01,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 24.74074074074074) internal successors, (668), 28 states have internal predecessors, (668), 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-06 18:11:01,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 2779 transitions. [2025-02-06 18:11:01,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2025-02-06 18:11:01,677 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:11:01,677 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:11:01,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 18:11:01,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:11:01,881 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:11:01,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:11:01,882 INFO L85 PathProgramCache]: Analyzing trace with hash -192805623, now seen corresponding path program 2 times [2025-02-06 18:11:01,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:11:01,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060204211] [2025-02-06 18:11:01,882 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:11:01,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:11:01,992 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 566 statements into 2 equivalence classes. [2025-02-06 18:11:02,110 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 566 of 566 statements. [2025-02-06 18:11:02,110 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:11:02,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:11:03,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1637 backedges. 0 proven. 1633 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:11:03,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:11:03,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060204211] [2025-02-06 18:11:03,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060204211] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:11:03,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609455371] [2025-02-06 18:11:03,227 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:11:03,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:11:03,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:11:03,229 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-06 18:11:03,229 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-06 18:11:03,670 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 566 statements into 2 equivalence classes. [2025-02-06 18:11:03,965 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 566 of 566 statements. [2025-02-06 18:11:03,966 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:11:03,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:11:03,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 2814 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 18:11:03,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:11:04,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1637 backedges. 0 proven. 1633 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:11:04,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:11:04,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1637 backedges. 0 proven. 1633 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:11:04,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609455371] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:11:04,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:11:04,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-02-06 18:11:04,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758496011] [2025-02-06 18:11:04,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:11:04,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 18:11:04,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:11:04,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 18:11:04,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-02-06 18:11:04,993 INFO L87 Difference]: Start difference. First operand 1976 states and 2779 transitions. Second operand has 23 states, 23 states have (on average 35.17391304347826) internal successors, (809), 23 states have internal predecessors, (809), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 18:11:05,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:11:05,437 INFO L93 Difference]: Finished difference Result 1981 states and 2784 transitions. [2025-02-06 18:11:05,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 18:11:05,437 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 35.17391304347826) internal successors, (809), 23 states have internal predecessors, (809), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 566 [2025-02-06 18:11:05,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:11:05,445 INFO L225 Difference]: With dead ends: 1981 [2025-02-06 18:11:05,445 INFO L226 Difference]: Without dead ends: 1976 [2025-02-06 18:11:05,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1147 GetRequests, 1115 SyntacticMatches, 11 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-02-06 18:11:05,452 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 5233 mSDsluCounter, 3649 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5259 SdHoareTripleChecker+Valid, 3990 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 18:11:05,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5259 Valid, 3990 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 18:11:05,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1976 states. [2025-02-06 18:11:05,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1976 to 1976. [2025-02-06 18:11:05,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1976 states, 1941 states have (on average 1.3992787223080887) internal successors, (2716), 1944 states have internal predecessors, (2716), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 18:11:05,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 2776 transitions. [2025-02-06 18:11:05,493 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 2776 transitions. Word has length 566 [2025-02-06 18:11:05,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:11:05,494 INFO L471 AbstractCegarLoop]: Abstraction has 1976 states and 2776 transitions. [2025-02-06 18:11:05,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 35.17391304347826) internal successors, (809), 23 states have internal predecessors, (809), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 18:11:05,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 2776 transitions. [2025-02-06 18:11:05,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 801 [2025-02-06 18:11:05,507 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:11:05,508 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:11:05,519 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-06 18:11:05,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-06 18:11:05,709 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:11:05,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:11:05,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1578617714, now seen corresponding path program 3 times [2025-02-06 18:11:05,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:11:05,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919990102] [2025-02-06 18:11:05,710 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 18:11:05,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:11:05,871 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 800 statements into 12 equivalence classes. [2025-02-06 18:11:05,929 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 83 of 800 statements. [2025-02-06 18:11:05,933 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 18:11:05,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:11:06,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3506 backedges. 638 proven. 0 refuted. 0 times theorem prover too weak. 2868 trivial. 0 not checked. [2025-02-06 18:11:06,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:11:06,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919990102] [2025-02-06 18:11:06,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919990102] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:11:06,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:11:06,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 18:11:06,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006148663] [2025-02-06 18:11:06,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:11:06,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:11:06,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:11:06,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:11:06,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:11:06,094 INFO L87 Difference]: Start difference. First operand 1976 states and 2776 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:11:06,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:11:06,546 INFO L93 Difference]: Finished difference Result 4201 states and 5873 transitions. [2025-02-06 18:11:06,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:11:06,547 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 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 800 [2025-02-06 18:11:06,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:11:06,553 INFO L225 Difference]: With dead ends: 4201 [2025-02-06 18:11:06,553 INFO L226 Difference]: Without dead ends: 2316 [2025-02-06 18:11:06,556 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-06 18:11:06,558 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 14 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 18:11:06,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 796 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 18:11:06,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2316 states. [2025-02-06 18:11:06,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2316 to 2266. [2025-02-06 18:11:06,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2266 states, 2231 states have (on average 1.3787539220080682) internal successors, (3076), 2234 states have internal predecessors, (3076), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 18:11:06,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2266 states to 2266 states and 3136 transitions. [2025-02-06 18:11:06,591 INFO L78 Accepts]: Start accepts. Automaton has 2266 states and 3136 transitions. Word has length 800 [2025-02-06 18:11:06,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:11:06,593 INFO L471 AbstractCegarLoop]: Abstraction has 2266 states and 3136 transitions. [2025-02-06 18:11:06,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:11:06,593 INFO L276 IsEmpty]: Start isEmpty. Operand 2266 states and 3136 transitions. [2025-02-06 18:11:06,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 811 [2025-02-06 18:11:06,598 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:11:06,598 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:11:06,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 18:11:06,599 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:11:06,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:11:06,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1262108644, now seen corresponding path program 1 times [2025-02-06 18:11:06,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:11:06,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508529748] [2025-02-06 18:11:06,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:11:06,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:11:06,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 810 statements into 1 equivalence classes.