./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-2.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 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:48:58,532 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:48:58,611 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 13:48:58,620 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:48:58,620 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:48:58,644 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:48:58,645 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:48:58,646 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:48:58,646 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:48:58,647 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:48:58,647 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:48:58,647 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:48:58,647 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:48:58,648 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:48:58,648 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:48:58,648 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:48:58,649 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:48:58,649 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 13:48:58,649 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:48:58,649 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 13:48:58,649 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:48:58,650 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:48:58,650 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:48:58,650 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:48:58,650 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:48:58,650 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:48:58,650 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 13:48:58,650 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:48:58,650 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:48:58,650 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:48:58,651 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:48:58,651 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:48:58,651 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:48:58,651 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:48:58,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:48:58,652 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:48:58,652 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:48:58,652 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:48:58,652 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:48:58,652 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:48:58,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:48:58,653 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:48:58,653 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:48:58,653 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:48:58,653 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:48:58,653 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 -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2025-02-08 13:48:58,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:48:58,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:48:58,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:48:58,974 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:48:58,975 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:48:58,977 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_SFH_nondet_test1-2.i [2025-02-08 13:49:00,371 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb22e1a55/886ea601b2b345f8aa59e4bfc3893686/FLAGc460c97be [2025-02-08 13:49:00,710 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:49:00,711 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-2.i [2025-02-08 13:49:00,742 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb22e1a55/886ea601b2b345f8aa59e4bfc3893686/FLAGc460c97be [2025-02-08 13:49:00,934 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb22e1a55/886ea601b2b345f8aa59e4bfc3893686 [2025-02-08 13:49:00,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:49:00,938 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:49:00,939 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:49:00,939 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:49:00,944 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:49:00,947 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:49:00" (1/1) ... [2025-02-08 13:49:00,950 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ecc5b62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:00, skipping insertion in model container [2025-02-08 13:49:00,950 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:49:00" (1/1) ... [2025-02-08 13:49:00,999 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:49:01,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:49:01,476 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:49:01,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:49:01,631 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:49:01,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:01 WrapperNode [2025-02-08 13:49:01,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:49:01,633 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:49:01,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:49:01,633 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:49:01,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:01" (1/1) ... [2025-02-08 13:49:01,665 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:01" (1/1) ... [2025-02-08 13:49:01,711 INFO L138 Inliner]: procedures = 176, calls = 221, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 938 [2025-02-08 13:49:01,711 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:49:01,712 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:49:01,712 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:49:01,712 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:49:01,726 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:01" (1/1) ... [2025-02-08 13:49:01,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:01" (1/1) ... [2025-02-08 13:49:01,735 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:01" (1/1) ... [2025-02-08 13:49:01,788 INFO L175 MemorySlicer]: Split 206 memory accesses to 2 slices as follows [2, 204]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 50 writes are split as follows [0, 50]. [2025-02-08 13:49:01,788 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:01" (1/1) ... [2025-02-08 13:49:01,789 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:01" (1/1) ... [2025-02-08 13:49:01,817 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:01" (1/1) ... [2025-02-08 13:49:01,820 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:01" (1/1) ... [2025-02-08 13:49:01,826 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:01" (1/1) ... [2025-02-08 13:49:01,829 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:01" (1/1) ... [2025-02-08 13:49:01,839 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:49:01,840 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:49:01,840 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:49:01,840 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:49:01,843 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:01" (1/1) ... [2025-02-08 13:49:01,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:49:01,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:49:01,892 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 13:49:01,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 13:49:01,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 13:49:01,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 13:49:01,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 13:49:01,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 13:49:01,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 13:49:01,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 13:49:01,924 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 13:49:01,924 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 13:49:01,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:49:01,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:49:01,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 13:49:01,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 13:49:01,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 13:49:01,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 13:49:01,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:49:01,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 13:49:01,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 13:49:01,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:49:01,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:49:02,131 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:49:02,133 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:49:03,330 INFO L? ?]: Removed 227 outVars from TransFormulas that were not future-live. [2025-02-08 13:49:03,330 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:49:03,398 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:49:03,400 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-08 13:49:03,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:49:03 BoogieIcfgContainer [2025-02-08 13:49:03,401 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:49:03,403 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:49:03,404 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:49:03,409 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:49:03,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:49:00" (1/3) ... [2025-02-08 13:49:03,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bcb8447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:49:03, skipping insertion in model container [2025-02-08 13:49:03,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:01" (2/3) ... [2025-02-08 13:49:03,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bcb8447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:49:03, skipping insertion in model container [2025-02-08 13:49:03,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:49:03" (3/3) ... [2025-02-08 13:49:03,414 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_nondet_test1-2.i [2025-02-08 13:49:03,429 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:49:03,432 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_nondet_test1-2.i that has 3 procedures, 253 locations, 1 initial locations, 25 loop locations, and 6 error locations. [2025-02-08 13:49:03,499 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:49:03,513 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;@7fb1687, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:49:03,514 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 13:49:03,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 249 states, 238 states have (on average 1.6176470588235294) internal successors, (385), 244 states have internal predecessors, (385), 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-08 13:49:03,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 13:49:03,525 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:03,526 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 13:49:03,527 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-08 13:49:03,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:03,533 INFO L85 PathProgramCache]: Analyzing trace with hash 13361228, now seen corresponding path program 1 times [2025-02-08 13:49:03,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:03,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439495145] [2025-02-08 13:49:03,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:03,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:03,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 13:49:03,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 13:49:03,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:03,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:03,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:49:03,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:03,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439495145] [2025-02-08 13:49:03,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439495145] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:03,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:49:03,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:49:03,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550731247] [2025-02-08 13:49:03,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:03,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:49:03,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:03,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:49:03,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:49:03,737 INFO L87 Difference]: Start difference. First operand has 249 states, 238 states have (on average 1.6176470588235294) internal successors, (385), 244 states have internal predecessors, (385), 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.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:49:03,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:03,915 INFO L93 Difference]: Finished difference Result 692 states and 1095 transitions. [2025-02-08 13:49:03,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:49:03,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-08 13:49:03,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:03,930 INFO L225 Difference]: With dead ends: 692 [2025-02-08 13:49:03,930 INFO L226 Difference]: Without dead ends: 406 [2025-02-08 13:49:03,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:49:03,936 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 276 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:03,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 681 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:49:03,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-02-08 13:49:03,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 211. [2025-02-08 13:49:03,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 201 states have (on average 1.4577114427860696) internal successors, (293), 206 states have internal predecessors, (293), 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-08 13:49:04,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 299 transitions. [2025-02-08 13:49:04,004 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 299 transitions. Word has length 4 [2025-02-08 13:49:04,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:04,006 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 299 transitions. [2025-02-08 13:49:04,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:49:04,006 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 299 transitions. [2025-02-08 13:49:04,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 13:49:04,007 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:04,007 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 13:49:04,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:49:04,007 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-08 13:49:04,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:04,007 INFO L85 PathProgramCache]: Analyzing trace with hash 424633884, now seen corresponding path program 1 times [2025-02-08 13:49:04,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:04,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402754523] [2025-02-08 13:49:04,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:04,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:04,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 13:49:04,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 13:49:04,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:04,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:04,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:49:04,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:04,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402754523] [2025-02-08 13:49:04,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402754523] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:04,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:49:04,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:49:04,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390973187] [2025-02-08 13:49:04,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:04,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:49:04,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:04,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:49:04,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:49:04,245 INFO L87 Difference]: Start difference. First operand 211 states and 299 transitions. Second operand has 4 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-08 13:49:04,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:04,330 INFO L93 Difference]: Finished difference Result 216 states and 305 transitions. [2025-02-08 13:49:04,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:49:04,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 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-08 13:49:04,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:04,332 INFO L225 Difference]: With dead ends: 216 [2025-02-08 13:49:04,332 INFO L226 Difference]: Without dead ends: 215 [2025-02-08 13:49:04,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-08 13:49:04,333 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 2 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 542 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-08 13:49:04,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 542 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:49:04,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-02-08 13:49:04,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2025-02-08 13:49:04,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 204 states have (on average 1.4509803921568627) internal successors, (296), 209 states have internal predecessors, (296), 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-08 13:49:04,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 302 transitions. [2025-02-08 13:49:04,352 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 302 transitions. Word has length 5 [2025-02-08 13:49:04,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:04,352 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 302 transitions. [2025-02-08 13:49:04,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-08 13:49:04,352 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 302 transitions. [2025-02-08 13:49:04,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:49:04,352 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:04,352 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 13:49:04,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 13:49:04,353 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-08 13:49:04,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:04,354 INFO L85 PathProgramCache]: Analyzing trace with hash 278748893, now seen corresponding path program 1 times [2025-02-08 13:49:04,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:04,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386559321] [2025-02-08 13:49:04,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:04,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:04,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:49:04,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:49:04,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:04,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:04,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:49:04,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:04,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386559321] [2025-02-08 13:49:04,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386559321] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:04,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:49:04,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:49:04,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987918202] [2025-02-08 13:49:04,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:04,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:49:04,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:04,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:49:04,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:49:04,534 INFO L87 Difference]: Start difference. First operand 214 states and 302 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:49:04,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:04,633 INFO L93 Difference]: Finished difference Result 216 states and 304 transitions. [2025-02-08 13:49:04,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:49:04,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 13:49:04,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:04,635 INFO L225 Difference]: With dead ends: 216 [2025-02-08 13:49:04,635 INFO L226 Difference]: Without dead ends: 215 [2025-02-08 13:49:04,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-08 13:49:04,636 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 0 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:04,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 807 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:49:04,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-02-08 13:49:04,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2025-02-08 13:49:04,660 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-08 13:49:04,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 303 transitions. [2025-02-08 13:49:04,661 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 303 transitions. Word has length 6 [2025-02-08 13:49:04,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:04,662 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 303 transitions. [2025-02-08 13:49:04,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:49:04,662 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 303 transitions. [2025-02-08 13:49:04,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-08 13:49:04,666 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:04,666 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] [2025-02-08 13:49:04,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:49:04,666 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-08 13:49:04,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:04,667 INFO L85 PathProgramCache]: Analyzing trace with hash -2004957684, now seen corresponding path program 1 times [2025-02-08 13:49:04,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:04,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783153842] [2025-02-08 13:49:04,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:04,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:04,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 13:49:04,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 13:49:04,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:04,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:04,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:49:04,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:04,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783153842] [2025-02-08 13:49:04,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783153842] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:04,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:49:04,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:49:04,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617281330] [2025-02-08 13:49:04,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:04,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:49:04,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:04,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:49:04,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:49:04,990 INFO L87 Difference]: Start difference. First operand 215 states and 303 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:49:05,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:05,162 INFO L93 Difference]: Finished difference Result 427 states and 603 transitions. [2025-02-08 13:49:05,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:49:05,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 78 [2025-02-08 13:49:05,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:05,165 INFO L225 Difference]: With dead ends: 427 [2025-02-08 13:49:05,165 INFO L226 Difference]: Without dead ends: 218 [2025-02-08 13:49:05,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:49:05,169 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 106 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:05,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 663 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:49:05,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-08 13:49:05,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 215. [2025-02-08 13:49:05,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 205 states have (on average 1.4146341463414633) internal successors, (290), 210 states have internal predecessors, (290), 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-08 13:49:05,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 296 transitions. [2025-02-08 13:49:05,180 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 296 transitions. Word has length 78 [2025-02-08 13:49:05,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:05,180 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 296 transitions. [2025-02-08 13:49:05,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:49:05,180 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 296 transitions. [2025-02-08 13:49:05,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-08 13:49:05,182 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:05,183 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] [2025-02-08 13:49:05,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 13:49:05,183 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-08 13:49:05,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:05,184 INFO L85 PathProgramCache]: Analyzing trace with hash 904065893, now seen corresponding path program 1 times [2025-02-08 13:49:05,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:05,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380351252] [2025-02-08 13:49:05,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:05,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:05,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 13:49:05,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 13:49:05,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:05,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:05,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:49:05,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:05,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380351252] [2025-02-08 13:49:05,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380351252] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:05,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:49:05,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:49:05,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152931396] [2025-02-08 13:49:05,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:05,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:49:05,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:05,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:49:05,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:49:05,369 INFO L87 Difference]: Start difference. First operand 215 states and 296 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:49:05,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:05,455 INFO L93 Difference]: Finished difference Result 430 states and 595 transitions. [2025-02-08 13:49:05,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:49:05,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 78 [2025-02-08 13:49:05,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:05,458 INFO L225 Difference]: With dead ends: 430 [2025-02-08 13:49:05,459 INFO L226 Difference]: Without dead ends: 221 [2025-02-08 13:49:05,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:49:05,461 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 2 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:05,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 504 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:49:05,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-02-08 13:49:05,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2025-02-08 13:49:05,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 211 states have (on average 1.4028436018957346) internal successors, (296), 216 states have internal predecessors, (296), 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-08 13:49:05,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 302 transitions. [2025-02-08 13:49:05,473 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 302 transitions. Word has length 78 [2025-02-08 13:49:05,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:05,473 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 302 transitions. [2025-02-08 13:49:05,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:49:05,474 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 302 transitions. [2025-02-08 13:49:05,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-08 13:49:05,479 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:05,479 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] [2025-02-08 13:49:05,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 13:49:05,480 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-08 13:49:05,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:05,482 INFO L85 PathProgramCache]: Analyzing trace with hash 134895878, now seen corresponding path program 1 times [2025-02-08 13:49:05,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:05,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646513482] [2025-02-08 13:49:05,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:05,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:05,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 13:49:05,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 13:49:05,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:05,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:05,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:49:05,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:05,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646513482] [2025-02-08 13:49:05,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646513482] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:05,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:49:05,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:49:05,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373017917] [2025-02-08 13:49:05,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:05,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:49:05,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:05,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:49:05,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:49:05,750 INFO L87 Difference]: Start difference. First operand 221 states and 302 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:49:05,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:05,878 INFO L93 Difference]: Finished difference Result 568 states and 790 transitions. [2025-02-08 13:49:05,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:49:05,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 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 78 [2025-02-08 13:49:05,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:05,883 INFO L225 Difference]: With dead ends: 568 [2025-02-08 13:49:05,883 INFO L226 Difference]: Without dead ends: 353 [2025-02-08 13:49:05,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:49:05,884 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 134 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 528 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-08 13:49:05,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 528 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:49:05,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-02-08 13:49:05,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2025-02-08 13:49:05,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 343 states have (on average 1.4198250728862973) internal successors, (487), 348 states have internal predecessors, (487), 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-08 13:49:05,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 493 transitions. [2025-02-08 13:49:05,902 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 493 transitions. Word has length 78 [2025-02-08 13:49:05,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:05,903 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 493 transitions. [2025-02-08 13:49:05,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:49:05,904 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 493 transitions. [2025-02-08 13:49:05,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-08 13:49:05,908 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:05,909 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] [2025-02-08 13:49:05,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:49:05,909 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:49:05,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:05,909 INFO L85 PathProgramCache]: Analyzing trace with hash -467853696, now seen corresponding path program 1 times [2025-02-08 13:49:05,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:05,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142670770] [2025-02-08 13:49:05,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:05,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:05,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 13:49:05,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 13:49:05,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:05,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:06,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:49:06,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:06,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142670770] [2025-02-08 13:49:06,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142670770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:06,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:49:06,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:49:06,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238487657] [2025-02-08 13:49:06,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:06,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:49:06,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:06,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:49:06,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:49:06,214 INFO L87 Difference]: Start difference. First operand 353 states and 493 transitions. Second operand has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:49:06,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:06,287 INFO L93 Difference]: Finished difference Result 353 states and 493 transitions. [2025-02-08 13:49:06,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:49:06,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 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 93 [2025-02-08 13:49:06,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:06,290 INFO L225 Difference]: With dead ends: 353 [2025-02-08 13:49:06,290 INFO L226 Difference]: Without dead ends: 352 [2025-02-08 13:49:06,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:49:06,291 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 190 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:06,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 533 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:49:06,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-02-08 13:49:06,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2025-02-08 13:49:06,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 343 states have (on average 1.4169096209912537) internal successors, (486), 347 states have internal predecessors, (486), 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-08 13:49:06,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 492 transitions. [2025-02-08 13:49:06,311 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 492 transitions. Word has length 93 [2025-02-08 13:49:06,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:06,312 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 492 transitions. [2025-02-08 13:49:06,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:49:06,312 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 492 transitions. [2025-02-08 13:49:06,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-08 13:49:06,313 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:06,313 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-08 13:49:06,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:49:06,314 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:49:06,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:06,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1618562642, now seen corresponding path program 1 times [2025-02-08 13:49:06,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:06,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567573204] [2025-02-08 13:49:06,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:06,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:06,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 13:49:06,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 13:49:06,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:06,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:06,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:49:06,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:06,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567573204] [2025-02-08 13:49:06,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567573204] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:06,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:49:06,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:49:06,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656787393] [2025-02-08 13:49:06,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:06,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:49:06,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:06,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:49:06,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:49:06,598 INFO L87 Difference]: Start difference. First operand 352 states and 492 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-08 13:49:06,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:06,715 INFO L93 Difference]: Finished difference Result 416 states and 576 transitions. [2025-02-08 13:49:06,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:49:06,715 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-08 13:49:06,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:06,718 INFO L225 Difference]: With dead ends: 416 [2025-02-08 13:49:06,718 INFO L226 Difference]: Without dead ends: 415 [2025-02-08 13:49:06,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:49:06,719 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 184 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:06,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 785 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:49:06,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-02-08 13:49:06,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2025-02-08 13:49:06,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 403 states have (on average 1.3970223325062034) internal successors, (563), 407 states have internal predecessors, (563), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:49:06,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 575 transitions. [2025-02-08 13:49:06,734 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 575 transitions. Word has length 94 [2025-02-08 13:49:06,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:06,734 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 575 transitions. [2025-02-08 13:49:06,734 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-08 13:49:06,735 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 575 transitions. [2025-02-08 13:49:06,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-08 13:49:06,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:06,736 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] [2025-02-08 13:49:06,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 13:49:06,736 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:49:06,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:06,737 INFO L85 PathProgramCache]: Analyzing trace with hash 998209021, now seen corresponding path program 1 times [2025-02-08 13:49:06,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:06,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036337941] [2025-02-08 13:49:06,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:06,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:06,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-08 13:49:06,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-08 13:49:06,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:06,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:07,015 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-08 13:49:07,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:07,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036337941] [2025-02-08 13:49:07,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036337941] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:49:07,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591121034] [2025-02-08 13:49:07,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:07,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:49:07,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:49:07,020 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:49:07,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 13:49:07,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-08 13:49:07,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-08 13:49:07,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:07,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:07,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 13:49:07,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:49:07,522 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-08 13:49:07,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:49:07,713 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-08 13:49:07,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591121034] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:49:07,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:49:07,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-08 13:49:07,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256681451] [2025-02-08 13:49:07,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:49:07,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 13:49:07,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:07,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 13:49:07,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-08 13:49:07,715 INFO L87 Difference]: Start difference. First operand 415 states and 575 transitions. Second operand has 8 states, 8 states have (on average 21.875) internal successors, (175), 8 states have internal predecessors, (175), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 13:49:07,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:07,913 INFO L93 Difference]: Finished difference Result 626 states and 868 transitions. [2025-02-08 13:49:07,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 13:49:07,914 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.875) internal successors, (175), 8 states have internal predecessors, (175), 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 97 [2025-02-08 13:49:07,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:07,917 INFO L225 Difference]: With dead ends: 626 [2025-02-08 13:49:07,917 INFO L226 Difference]: Without dead ends: 620 [2025-02-08 13:49:07,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-08 13:49:07,918 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 1202 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1209 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:07,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1209 Valid, 1226 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:49:07,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2025-02-08 13:49:07,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 618. [2025-02-08 13:49:07,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 603 states have (on average 1.3963515754560532) internal successors, (842), 607 states have internal predecessors, (842), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 13:49:07,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 860 transitions. [2025-02-08 13:49:07,957 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 860 transitions. Word has length 97 [2025-02-08 13:49:07,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:07,958 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 860 transitions. [2025-02-08 13:49:07,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.875) internal successors, (175), 8 states have internal predecessors, (175), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 13:49:07,958 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 860 transitions. [2025-02-08 13:49:07,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-08 13:49:07,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:07,959 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] [2025-02-08 13:49:07,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 13:49:08,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:49:08,160 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:49:08,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:08,161 INFO L85 PathProgramCache]: Analyzing trace with hash 890144395, now seen corresponding path program 1 times [2025-02-08 13:49:08,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:08,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614838698] [2025-02-08 13:49:08,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:08,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:08,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 13:49:08,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 13:49:08,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:08,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:08,856 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-08 13:49:08,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:08,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614838698] [2025-02-08 13:49:08,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614838698] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:49:08,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77643986] [2025-02-08 13:49:08,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:08,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:49:08,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:49:08,859 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:49:08,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 13:49:09,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 13:49:09,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 13:49:09,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:09,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:09,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 13:49:09,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:49:09,380 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-08 13:49:09,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:49:09,593 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-08 13:49:09,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77643986] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:49:09,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:49:09,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-02-08 13:49:09,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189600780] [2025-02-08 13:49:09,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:49:09,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 13:49:09,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:09,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 13:49:09,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-02-08 13:49:09,596 INFO L87 Difference]: Start difference. First operand 618 states and 860 transitions. Second operand has 13 states, 12 states have (on average 15.583333333333334) internal successors, (187), 13 states have internal predecessors, (187), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 13:49:09,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:09,946 INFO L93 Difference]: Finished difference Result 829 states and 1157 transitions. [2025-02-08 13:49:09,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 13:49:09,947 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 15.583333333333334) internal successors, (187), 13 states have internal predecessors, (187), 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 98 [2025-02-08 13:49:09,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:09,951 INFO L225 Difference]: With dead ends: 829 [2025-02-08 13:49:09,951 INFO L226 Difference]: Without dead ends: 828 [2025-02-08 13:49:09,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 188 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-08 13:49:09,952 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 789 mSDsluCounter, 1797 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 2136 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:09,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 2136 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 13:49:09,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2025-02-08 13:49:09,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 823. [2025-02-08 13:49:09,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 805 states have (on average 1.3950310559006212) internal successors, (1123), 809 states have internal predecessors, (1123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 13:49:09,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1147 transitions. [2025-02-08 13:49:09,977 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1147 transitions. Word has length 98 [2025-02-08 13:49:09,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:09,978 INFO L471 AbstractCegarLoop]: Abstraction has 823 states and 1147 transitions. [2025-02-08 13:49:09,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 15.583333333333334) internal successors, (187), 13 states have internal predecessors, (187), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 13:49:09,978 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1147 transitions. [2025-02-08 13:49:09,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-08 13:49:09,979 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:09,979 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] [2025-02-08 13:49:09,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 13:49:10,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:49:10,183 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:49:10,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:10,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1824672846, now seen corresponding path program 1 times [2025-02-08 13:49:10,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:10,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29977510] [2025-02-08 13:49:10,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:10,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:10,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 13:49:10,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 13:49:10,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:10,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:10,803 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-08 13:49:10,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:10,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29977510] [2025-02-08 13:49:10,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29977510] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:49:10,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946563887] [2025-02-08 13:49:10,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:10,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:49:10,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:49:10,806 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:49:10,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 13:49:11,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 13:49:11,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 13:49:11,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:11,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:11,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 13:49:11,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:49:11,345 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-08 13:49:11,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:49:11,535 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-08 13:49:11,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946563887] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:49:11,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:49:11,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-02-08 13:49:11,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107385446] [2025-02-08 13:49:11,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:49:11,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 13:49:11,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:11,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 13:49:11,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-02-08 13:49:11,538 INFO L87 Difference]: Start difference. First operand 823 states and 1147 transitions. Second operand has 13 states, 12 states have (on average 15.833333333333334) internal successors, (190), 13 states have internal predecessors, (190), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 13:49:11,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:11,857 INFO L93 Difference]: Finished difference Result 829 states and 1154 transitions. [2025-02-08 13:49:11,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 13:49:11,858 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 15.833333333333334) internal successors, (190), 13 states have internal predecessors, (190), 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-08 13:49:11,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:11,862 INFO L225 Difference]: With dead ends: 829 [2025-02-08 13:49:11,862 INFO L226 Difference]: Without dead ends: 828 [2025-02-08 13:49:11,862 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-08 13:49:11,863 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 644 mSDsluCounter, 1850 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:11,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 2112 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:49:11,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2025-02-08 13:49:11,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 824. [2025-02-08 13:49:11,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 806 states have (on average 1.3920595533498759) internal successors, (1122), 810 states have internal predecessors, (1122), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 13:49:11,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1146 transitions. [2025-02-08 13:49:11,891 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1146 transitions. Word has length 99 [2025-02-08 13:49:11,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:11,892 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 1146 transitions. [2025-02-08 13:49:11,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 15.833333333333334) internal successors, (190), 13 states have internal predecessors, (190), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 13:49:11,892 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1146 transitions. [2025-02-08 13:49:11,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-02-08 13:49:11,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:11,897 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] [2025-02-08 13:49:11,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 13:49:12,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:49:12,098 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:49:12,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:12,099 INFO L85 PathProgramCache]: Analyzing trace with hash -453648960, now seen corresponding path program 1 times [2025-02-08 13:49:12,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:12,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725114378] [2025-02-08 13:49:12,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:12,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:12,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-02-08 13:49:12,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-02-08 13:49:12,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:12,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:12,490 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-08 13:49:12,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:12,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725114378] [2025-02-08 13:49:12,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725114378] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:12,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:49:12,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:49:12,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832977177] [2025-02-08 13:49:12,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:12,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:49:12,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:12,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:49:12,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:49:12,492 INFO L87 Difference]: Start difference. First operand 824 states and 1146 transitions. Second operand has 4 states, 3 states have (on average 56.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:49:12,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:12,565 INFO L93 Difference]: Finished difference Result 824 states and 1146 transitions. [2025-02-08 13:49:12,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:49:12,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 56.0) internal successors, (168), 4 states have internal predecessors, (168), 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 250 [2025-02-08 13:49:12,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:12,569 INFO L225 Difference]: With dead ends: 824 [2025-02-08 13:49:12,570 INFO L226 Difference]: Without dead ends: 823 [2025-02-08 13:49:12,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:49:12,571 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 194 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 535 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.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:12,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 535 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:49:12,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2025-02-08 13:49:12,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 823. [2025-02-08 13:49:12,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 806 states have (on average 1.3895781637717122) internal successors, (1120), 809 states have internal predecessors, (1120), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 13:49:12,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1144 transitions. [2025-02-08 13:49:12,597 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1144 transitions. Word has length 250 [2025-02-08 13:49:12,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:12,598 INFO L471 AbstractCegarLoop]: Abstraction has 823 states and 1144 transitions. [2025-02-08 13:49:12,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 56.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:49:12,598 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1144 transitions. [2025-02-08 13:49:12,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-02-08 13:49:12,602 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:12,602 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] [2025-02-08 13:49:12,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 13:49:12,606 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:49:12,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:12,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1605957803, now seen corresponding path program 1 times [2025-02-08 13:49:12,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:12,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426377769] [2025-02-08 13:49:12,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:12,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:12,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-02-08 13:49:12,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-02-08 13:49:12,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:12,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:13,348 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-08 13:49:13,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:13,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426377769] [2025-02-08 13:49:13,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426377769] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:49:13,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136815449] [2025-02-08 13:49:13,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:13,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:49:13,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:49:13,351 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:49:13,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 13:49:13,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-02-08 13:49:13,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-02-08 13:49:13,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:13,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:13,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 1306 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 13:49:13,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:49:14,227 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-08 13:49:14,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:49:14,619 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-08 13:49:14,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136815449] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:49:14,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:49:14,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-02-08 13:49:14,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320890501] [2025-02-08 13:49:14,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:49:14,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 13:49:14,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:14,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 13:49:14,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-02-08 13:49:14,625 INFO L87 Difference]: Start difference. First operand 823 states and 1144 transitions. Second operand has 16 states, 16 states have (on average 30.4375) internal successors, (487), 16 states have internal predecessors, (487), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 13:49:15,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:15,050 INFO L93 Difference]: Finished difference Result 1434 states and 1998 transitions. [2025-02-08 13:49:15,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 13:49:15,051 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 30.4375) internal successors, (487), 16 states have internal predecessors, (487), 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 253 [2025-02-08 13:49:15,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:15,058 INFO L225 Difference]: With dead ends: 1434 [2025-02-08 13:49:15,058 INFO L226 Difference]: Without dead ends: 1429 [2025-02-08 13:49:15,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-02-08 13:49:15,060 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 3463 mSDsluCounter, 2013 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3482 SdHoareTripleChecker+Valid, 2392 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:15,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3482 Valid, 2392 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 13:49:15,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2025-02-08 13:49:15,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 1425. [2025-02-08 13:49:15,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1425 states, 1399 states have (on average 1.3917083631165117) internal successors, (1947), 1402 states have internal predecessors, (1947), 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-08 13:49:15,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1425 states and 1989 transitions. [2025-02-08 13:49:15,112 INFO L78 Accepts]: Start accepts. Automaton has 1425 states and 1989 transitions. Word has length 253 [2025-02-08 13:49:15,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:15,114 INFO L471 AbstractCegarLoop]: Abstraction has 1425 states and 1989 transitions. [2025-02-08 13:49:15,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 30.4375) internal successors, (487), 16 states have internal predecessors, (487), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 13:49:15,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 1989 transitions. [2025-02-08 13:49:15,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-02-08 13:49:15,120 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:15,121 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] [2025-02-08 13:49:15,132 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-08 13:49:15,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-08 13:49:15,325 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:49:15,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:15,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1152277114, now seen corresponding path program 1 times [2025-02-08 13:49:15,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:15,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451180036] [2025-02-08 13:49:15,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:15,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:15,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-02-08 13:49:15,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-02-08 13:49:15,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:15,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:18,149 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-08 13:49:18,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:18,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451180036] [2025-02-08 13:49:18,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451180036] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:49:18,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689426999] [2025-02-08 13:49:18,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:18,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:49:18,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:49:18,152 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:49:18,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 13:49:18,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-02-08 13:49:18,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-02-08 13:49:18,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:18,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:18,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 1715 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-08 13:49:18,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:49:19,390 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-08 13:49:19,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:49:19,934 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-08 13:49:19,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689426999] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:49:19,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:49:19,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-02-08 13:49:19,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127831991] [2025-02-08 13:49:19,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:49:19,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-08 13:49:19,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:19,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-08 13:49:19,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=498, Unknown=0, NotChecked=0, Total=756 [2025-02-08 13:49:19,940 INFO L87 Difference]: Start difference. First operand 1425 states and 1989 transitions. Second operand has 28 states, 27 states have (on average 24.59259259259259) internal successors, (664), 28 states have internal predecessors, (664), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 13:49:20,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:20,711 INFO L93 Difference]: Finished difference Result 2045 states and 2865 transitions. [2025-02-08 13:49:20,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-08 13:49:20,712 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 24.59259259259259) internal successors, (664), 28 states have internal predecessors, (664), 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 332 [2025-02-08 13:49:20,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:20,723 INFO L225 Difference]: With dead ends: 2045 [2025-02-08 13:49:20,723 INFO L226 Difference]: Without dead ends: 2044 [2025-02-08 13:49:20,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 678 GetRequests, 647 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=338, Invalid=718, Unknown=0, NotChecked=0, Total=1056 [2025-02-08 13:49:20,725 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 3067 mSDsluCounter, 3938 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3090 SdHoareTripleChecker+Valid, 4276 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:20,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3090 Valid, 4276 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 13:49:20,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2025-02-08 13:49:20,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 2034. [2025-02-08 13:49:20,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2034 states, 1999 states have (on average 1.391695847923962) internal successors, (2782), 2002 states have internal predecessors, (2782), 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-08 13:49:20,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 2842 transitions. [2025-02-08 13:49:20,790 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 2842 transitions. Word has length 332 [2025-02-08 13:49:20,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:20,790 INFO L471 AbstractCegarLoop]: Abstraction has 2034 states and 2842 transitions. [2025-02-08 13:49:20,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 24.59259259259259) internal successors, (664), 28 states have internal predecessors, (664), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 13:49:20,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 2842 transitions. [2025-02-08 13:49:20,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-02-08 13:49:20,797 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:20,797 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] [2025-02-08 13:49:20,810 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-08 13:49:21,001 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,SelfDestructingSolverStorable13 [2025-02-08 13:49:21,001 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:49:21,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:21,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1360851789, now seen corresponding path program 1 times [2025-02-08 13:49:21,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:21,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085969493] [2025-02-08 13:49:21,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:21,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:21,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-02-08 13:49:21,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-02-08 13:49:21,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:21,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:23,411 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-08 13:49:23,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:23,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085969493] [2025-02-08 13:49:23,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085969493] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:49:23,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181127602] [2025-02-08 13:49:23,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:23,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:49:23,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:49:23,416 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:49:23,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 13:49:23,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-02-08 13:49:24,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-02-08 13:49:24,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:24,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:24,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 1716 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-08 13:49:24,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:49:24,551 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-08 13:49:24,551 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:49:24,982 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-08 13:49:24,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181127602] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:49:24,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:49:24,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-02-08 13:49:24,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510804060] [2025-02-08 13:49:24,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:49:24,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-08 13:49:24,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:24,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-08 13:49:24,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=498, Unknown=0, NotChecked=0, Total=756 [2025-02-08 13:49:24,985 INFO L87 Difference]: Start difference. First operand 2034 states and 2842 transitions. Second operand has 28 states, 27 states have (on average 24.703703703703702) internal successors, (667), 28 states have internal predecessors, (667), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 13:49:25,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:25,644 INFO L93 Difference]: Finished difference Result 2045 states and 2859 transitions. [2025-02-08 13:49:25,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-08 13:49:25,645 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 24.703703703703702) internal successors, (667), 28 states have internal predecessors, (667), 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-08 13:49:25,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:25,654 INFO L225 Difference]: With dead ends: 2045 [2025-02-08 13:49:25,655 INFO L226 Difference]: Without dead ends: 2044 [2025-02-08 13:49:25,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 680 GetRequests, 649 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=338, Invalid=718, Unknown=0, NotChecked=0, Total=1056 [2025-02-08 13:49:25,657 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 4242 mSDsluCounter, 4132 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4265 SdHoareTripleChecker+Valid, 4432 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:25,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4265 Valid, 4432 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 13:49:25,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2025-02-08 13:49:25,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 2035. [2025-02-08 13:49:25,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2035 states, 2000 states have (on average 1.389) internal successors, (2778), 2003 states have internal predecessors, (2778), 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-08 13:49:25,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 2838 transitions. [2025-02-08 13:49:25,714 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 2838 transitions. Word has length 333 [2025-02-08 13:49:25,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:25,715 INFO L471 AbstractCegarLoop]: Abstraction has 2035 states and 2838 transitions. [2025-02-08 13:49:25,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 24.703703703703702) internal successors, (667), 28 states have internal predecessors, (667), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 13:49:25,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 2838 transitions. [2025-02-08 13:49:25,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2025-02-08 13:49:25,726 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:25,726 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] [2025-02-08 13:49:25,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 13:49:25,927 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,SelfDestructingSolverStorable14 [2025-02-08 13:49:25,927 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-08 13:49:25,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:25,928 INFO L85 PathProgramCache]: Analyzing trace with hash 913820423, now seen corresponding path program 2 times [2025-02-08 13:49:25,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:25,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743970282] [2025-02-08 13:49:25,929 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:49:25,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:26,090 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 565 statements into 2 equivalence classes. [2025-02-08 13:49:26,329 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 565 of 565 statements. [2025-02-08 13:49:26,329 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:49:26,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:27,877 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-08 13:49:27,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:27,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743970282] [2025-02-08 13:49:27,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743970282] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:49:27,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445599254] [2025-02-08 13:49:27,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:49:27,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:49:27,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:49:27,879 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:49:27,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 13:49:28,438 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 565 statements into 2 equivalence classes. [2025-02-08 13:49:28,807 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 565 of 565 statements. [2025-02-08 13:49:28,807 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:49:28,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:28,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 2814 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 13:49:28,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:49:29,284 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-08 13:49:29,284 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:49:29,844 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-08 13:49:29,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445599254] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:49:29,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:49:29,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 21 [2025-02-08 13:49:29,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985559589] [2025-02-08 13:49:29,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:49:29,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 13:49:29,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:29,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 13:49:29,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2025-02-08 13:49:29,847 INFO L87 Difference]: Start difference. First operand 2035 states and 2838 transitions. Second operand has 21 states, 21 states have (on average 34.476190476190474) internal successors, (724), 21 states have internal predecessors, (724), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 13:49:30,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:30,261 INFO L93 Difference]: Finished difference Result 2040 states and 2843 transitions. [2025-02-08 13:49:30,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 13:49:30,262 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 34.476190476190474) internal successors, (724), 21 states have internal predecessors, (724), 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 565 [2025-02-08 13:49:30,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:30,271 INFO L225 Difference]: With dead ends: 2040 [2025-02-08 13:49:30,271 INFO L226 Difference]: Without dead ends: 2035 [2025-02-08 13:49:30,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1145 GetRequests, 1115 SyntacticMatches, 11 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2025-02-08 13:49:30,273 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 4298 mSDsluCounter, 3506 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4324 SdHoareTripleChecker+Valid, 3807 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:30,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4324 Valid, 3807 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 13:49:30,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2035 states. [2025-02-08 13:49:30,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2035 to 2035. [2025-02-08 13:49:30,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2035 states, 2000 states have (on average 1.3875) internal successors, (2775), 2003 states have internal predecessors, (2775), 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-08 13:49:30,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 2835 transitions. [2025-02-08 13:49:30,321 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 2835 transitions. Word has length 565 [2025-02-08 13:49:30,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:30,322 INFO L471 AbstractCegarLoop]: Abstraction has 2035 states and 2835 transitions. [2025-02-08 13:49:30,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 34.476190476190474) internal successors, (724), 21 states have internal predecessors, (724), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 13:49:30,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 2835 transitions. [2025-02-08 13:49:30,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 800 [2025-02-08 13:49:30,342 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:30,342 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] [2025-02-08 13:49:30,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 13:49:30,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:49:30,543 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-08 13:49:30,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:30,544 INFO L85 PathProgramCache]: Analyzing trace with hash -337673172, now seen corresponding path program 3 times [2025-02-08 13:49:30,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:30,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893782912] [2025-02-08 13:49:30,544 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 13:49:30,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:30,742 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 799 statements into 12 equivalence classes. [2025-02-08 13:49:30,837 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 82 of 799 statements. [2025-02-08 13:49:30,839 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 13:49:30,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:31,151 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-08 13:49:31,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:31,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893782912] [2025-02-08 13:49:31,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893782912] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:31,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:49:31,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 13:49:31,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776835299] [2025-02-08 13:49:31,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:31,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:49:31,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:31,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:49:31,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:49:31,154 INFO L87 Difference]: Start difference. First operand 2035 states and 2835 transitions. Second operand has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:49:31,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:31,849 INFO L93 Difference]: Finished difference Result 4379 states and 6054 transitions. [2025-02-08 13:49:31,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:49:31,851 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 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 799 [2025-02-08 13:49:31,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:31,860 INFO L225 Difference]: With dead ends: 4379 [2025-02-08 13:49:31,860 INFO L226 Difference]: Without dead ends: 2435 [2025-02-08 13:49:31,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:49:31,865 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 13 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:31,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 792 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 13:49:31,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2025-02-08 13:49:31,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 2395. [2025-02-08 13:49:31,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2395 states, 2360 states have (on average 1.3580508474576272) internal successors, (3205), 2363 states have internal predecessors, (3205), 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-08 13:49:31,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2395 states and 3265 transitions. [2025-02-08 13:49:31,924 INFO L78 Accepts]: Start accepts. Automaton has 2395 states and 3265 transitions. Word has length 799 [2025-02-08 13:49:31,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:31,924 INFO L471 AbstractCegarLoop]: Abstraction has 2395 states and 3265 transitions. [2025-02-08 13:49:31,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:49:31,925 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 3265 transitions. [2025-02-08 13:49:31,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 810 [2025-02-08 13:49:31,934 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:31,934 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] [2025-02-08 13:49:31,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 13:49:31,935 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:49:31,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:31,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1976866352, now seen corresponding path program 1 times [2025-02-08 13:49:31,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:31,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199120958] [2025-02-08 13:49:31,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:31,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:32,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 809 statements into 1 equivalence classes. [2025-02-08 13:49:32,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 809 of 809 statements. [2025-02-08 13:49:32,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:32,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:33,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3551 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 3208 trivial. 0 not checked. [2025-02-08 13:49:33,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:33,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199120958] [2025-02-08 13:49:33,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199120958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:33,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:49:33,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 13:49:33,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347417678] [2025-02-08 13:49:33,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:33,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:49:33,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:33,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:49:33,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:49:33,560 INFO L87 Difference]: Start difference. First operand 2395 states and 3265 transitions. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:49:33,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:33,993 INFO L93 Difference]: Finished difference Result 4773 states and 6535 transitions. [2025-02-08 13:49:33,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 13:49:33,993 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 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 809 [2025-02-08 13:49:33,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:34,001 INFO L225 Difference]: With dead ends: 4773 [2025-02-08 13:49:34,001 INFO L226 Difference]: Without dead ends: 2515 [2025-02-08 13:49:34,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:49:34,005 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 14 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:34,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 952 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 13:49:34,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2515 states. [2025-02-08 13:49:34,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2515 to 2485. [2025-02-08 13:49:34,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2485 states, 2450 states have (on average 1.3612244897959183) internal successors, (3335), 2453 states have internal predecessors, (3335), 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-08 13:49:34,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2485 states to 2485 states and 3395 transitions. [2025-02-08 13:49:34,061 INFO L78 Accepts]: Start accepts. Automaton has 2485 states and 3395 transitions. Word has length 809 [2025-02-08 13:49:34,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:34,061 INFO L471 AbstractCegarLoop]: Abstraction has 2485 states and 3395 transitions. [2025-02-08 13:49:34,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:49:34,062 INFO L276 IsEmpty]: Start isEmpty. Operand 2485 states and 3395 transitions. [2025-02-08 13:49:34,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2025-02-08 13:49:34,070 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:34,071 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, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:49:34,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 13:49:34,071 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:49:34,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:34,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1093924700, now seen corresponding path program 1 times [2025-02-08 13:49:34,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:34,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902704467] [2025-02-08 13:49:34,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:34,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:34,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 819 statements into 1 equivalence classes. [2025-02-08 13:49:34,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 819 of 819 statements. [2025-02-08 13:49:34,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:34,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:35,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3596 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 3262 trivial. 0 not checked. [2025-02-08 13:49:35,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:35,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902704467] [2025-02-08 13:49:35,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902704467] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:35,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:49:35,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 13:49:35,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321158684] [2025-02-08 13:49:35,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:35,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:49:35,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:35,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:49:35,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:49:35,648 INFO L87 Difference]: Start difference. First operand 2485 states and 3395 transitions. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:49:36,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:36,015 INFO L93 Difference]: Finished difference Result 4861 states and 6653 transitions. [2025-02-08 13:49:36,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:49:36,015 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 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 819 [2025-02-08 13:49:36,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:36,022 INFO L225 Difference]: With dead ends: 4861 [2025-02-08 13:49:36,022 INFO L226 Difference]: Without dead ends: 2515 [2025-02-08 13:49:36,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:49:36,027 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 8 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:36,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 819 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 13:49:36,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2515 states. [2025-02-08 13:49:36,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2515 to 2515. [2025-02-08 13:49:36,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2515 states, 2480 states have (on average 1.3568548387096775) internal successors, (3365), 2483 states have internal predecessors, (3365), 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-08 13:49:36,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2515 states to 2515 states and 3425 transitions. [2025-02-08 13:49:36,084 INFO L78 Accepts]: Start accepts. Automaton has 2515 states and 3425 transitions. Word has length 819 [2025-02-08 13:49:36,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:36,084 INFO L471 AbstractCegarLoop]: Abstraction has 2515 states and 3425 transitions. [2025-02-08 13:49:36,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:49:36,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2515 states and 3425 transitions. [2025-02-08 13:49:36,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2025-02-08 13:49:36,093 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:36,094 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, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:49:36,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 13:49:36,094 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:49:36,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:36,095 INFO L85 PathProgramCache]: Analyzing trace with hash 787345220, now seen corresponding path program 1 times [2025-02-08 13:49:36,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:36,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017118294] [2025-02-08 13:49:36,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:36,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:36,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 819 statements into 1 equivalence classes. [2025-02-08 13:49:36,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 819 of 819 statements. [2025-02-08 13:49:36,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:36,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:38,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3596 backedges. 370 proven. 0 refuted. 0 times theorem prover too weak. 3226 trivial. 0 not checked. [2025-02-08 13:49:38,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:38,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017118294] [2025-02-08 13:49:38,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017118294] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:38,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:49:38,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 13:49:38,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769268247] [2025-02-08 13:49:38,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:38,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 13:49:38,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:38,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 13:49:38,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 13:49:38,550 INFO L87 Difference]: Start difference. First operand 2515 states and 3425 transitions. Second operand has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 9 states have internal predecessors, (136), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:49:39,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:39,259 INFO L93 Difference]: Finished difference Result 5026 states and 6865 transitions. [2025-02-08 13:49:39,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 13:49:39,260 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 9 states have internal predecessors, (136), 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 819 [2025-02-08 13:49:39,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:39,265 INFO L225 Difference]: With dead ends: 5026 [2025-02-08 13:49:39,265 INFO L226 Difference]: Without dead ends: 2655 [2025-02-08 13:49:39,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 13:49:39,268 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 31 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:39,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1362 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 13:49:39,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2655 states. [2025-02-08 13:49:39,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2655 to 2595. [2025-02-08 13:49:39,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2595 states, 2560 states have (on average 1.353515625) internal successors, (3465), 2563 states have internal predecessors, (3465), 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-08 13:49:39,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2595 states and 3525 transitions. [2025-02-08 13:49:39,330 INFO L78 Accepts]: Start accepts. Automaton has 2595 states and 3525 transitions. Word has length 819 [2025-02-08 13:49:39,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:39,331 INFO L471 AbstractCegarLoop]: Abstraction has 2595 states and 3525 transitions. [2025-02-08 13:49:39,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 9 states have internal predecessors, (136), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:49:39,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 3525 transitions. [2025-02-08 13:49:39,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2025-02-08 13:49:39,346 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:39,346 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, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:49:39,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 13:49:39,347 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:49:39,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:39,347 INFO L85 PathProgramCache]: Analyzing trace with hash -340269012, now seen corresponding path program 1 times [2025-02-08 13:49:39,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:39,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936690941] [2025-02-08 13:49:39,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:39,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:39,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 829 statements into 1 equivalence classes.