./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test4-1.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_test4-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:49:17,241 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:49:17,297 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:49:17,304 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:49:17,305 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:49:17,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:49:17,329 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:49:17,329 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:49:17,330 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:49:17,330 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:49:17,330 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:49:17,331 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:49:17,331 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:49:17,331 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:49:17,331 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:49:17,331 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:49:17,331 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:49:17,332 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 13:49:17,332 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:49:17,332 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 13:49:17,332 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:49:17,332 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:49:17,332 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:49:17,332 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:49:17,332 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:49:17,332 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:49:17,332 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 13:49:17,332 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:49:17,333 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:49:17,333 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:49:17,333 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:49:17,333 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:49:17,333 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:49:17,333 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:49:17,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:49:17,334 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:49:17,334 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:49:17,334 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:49:17,334 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:49:17,334 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:49:17,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:49:17,334 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:49:17,334 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:49:17,334 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:49:17,334 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:49:17,334 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 -> ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f [2025-02-08 13:49:17,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:49:17,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:49:17,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:49:17,559 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:49:17,559 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:49:17,560 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_test4-1.i [2025-02-08 13:49:18,656 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce005701e/7b88af7776c244ecbae790a63b954941/FLAG2a3add047 [2025-02-08 13:49:18,968 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:49:18,968 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test4-1.i [2025-02-08 13:49:18,985 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce005701e/7b88af7776c244ecbae790a63b954941/FLAG2a3add047 [2025-02-08 13:49:19,005 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce005701e/7b88af7776c244ecbae790a63b954941 [2025-02-08 13:49:19,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:49:19,009 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:49:19,010 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:49:19,011 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:49:19,014 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:49:19,014 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:49:19" (1/1) ... [2025-02-08 13:49:19,015 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10a009d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:19, skipping insertion in model container [2025-02-08 13:49:19,015 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:49:19" (1/1) ... [2025-02-08 13:49:19,051 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:49:19,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:49:19,361 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:49:19,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:49:19,465 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:49:19,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:19 WrapperNode [2025-02-08 13:49:19,465 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:49:19,466 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:49:19,466 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:49:19,466 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:49:19,470 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:19" (1/1) ... [2025-02-08 13:49:19,491 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:19" (1/1) ... [2025-02-08 13:49:19,535 INFO L138 Inliner]: procedures = 176, calls = 326, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1509 [2025-02-08 13:49:19,535 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:49:19,535 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:49:19,536 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:49:19,536 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:49:19,541 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:19" (1/1) ... [2025-02-08 13:49:19,542 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:19" (1/1) ... [2025-02-08 13:49:19,552 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:19" (1/1) ... [2025-02-08 13:49:19,604 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2025-02-08 13:49:19,604 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:19" (1/1) ... [2025-02-08 13:49:19,604 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:19" (1/1) ... [2025-02-08 13:49:19,630 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:19" (1/1) ... [2025-02-08 13:49:19,632 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:19" (1/1) ... [2025-02-08 13:49:19,638 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:19" (1/1) ... [2025-02-08 13:49:19,640 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:19" (1/1) ... [2025-02-08 13:49:19,648 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:49:19,649 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:49:19,649 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:49:19,649 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:49:19,656 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:19" (1/1) ... [2025-02-08 13:49:19,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:49:19,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:49:19,681 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:19,684 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:19,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 13:49:19,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 13:49:19,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 13:49:19,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 13:49:19,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 13:49:19,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 13:49:19,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 13:49:19,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 13:49:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:49:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:49:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 13:49:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 13:49:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 13:49:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 13:49:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:49:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 13:49:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 13:49:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:49:19,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:49:19,897 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:49:19,899 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:49:21,051 INFO L? ?]: Removed 380 outVars from TransFormulas that were not future-live. [2025-02-08 13:49:21,051 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:49:21,116 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:49:21,116 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-08 13:49:21,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:49:21 BoogieIcfgContainer [2025-02-08 13:49:21,117 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:49:21,118 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:49:21,118 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:49:21,124 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:49:21,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:49:19" (1/3) ... [2025-02-08 13:49:21,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c35d9e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:49:21, skipping insertion in model container [2025-02-08 13:49:21,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:19" (2/3) ... [2025-02-08 13:49:21,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c35d9e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:49:21, skipping insertion in model container [2025-02-08 13:49:21,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:49:21" (3/3) ... [2025-02-08 13:49:21,127 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_nondet_test4-1.i [2025-02-08 13:49:21,138 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:49:21,140 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_nondet_test4-1.i that has 3 procedures, 408 locations, 1 initial locations, 36 loop locations, and 4 error locations. [2025-02-08 13:49:21,195 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:49:21,206 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;@61880176, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:49:21,207 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 13:49:21,210 INFO L276 IsEmpty]: Start isEmpty. Operand has 404 states, 391 states have (on average 1.6138107416879794) internal successors, (631), 396 states have internal predecessors, (631), 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:21,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:49:21,215 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:21,215 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 13:49:21,215 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:49:21,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:21,219 INFO L85 PathProgramCache]: Analyzing trace with hash -175858403, now seen corresponding path program 1 times [2025-02-08 13:49:21,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:21,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923778987] [2025-02-08 13:49:21,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:21,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:21,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:49:21,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:49:21,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:21,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:21,329 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:21,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:21,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923778987] [2025-02-08 13:49:21,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923778987] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:21,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:49:21,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:49:21,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677608888] [2025-02-08 13:49:21,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:21,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 13:49:21,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:21,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 13:49:21,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 13:49:21,353 INFO L87 Difference]: Start difference. First operand has 404 states, 391 states have (on average 1.6138107416879794) internal successors, (631), 396 states have internal predecessors, (631), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:49:21,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:21,466 INFO L93 Difference]: Finished difference Result 803 states and 1282 transitions. [2025-02-08 13:49:21,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 13:49:21,469 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 13:49:21,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:21,478 INFO L225 Difference]: With dead ends: 803 [2025-02-08 13:49:21,478 INFO L226 Difference]: Without dead ends: 393 [2025-02-08 13:49:21,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 13:49:21,482 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:21,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 534 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:49:21,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-02-08 13:49:21,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2025-02-08 13:49:21,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 383 states have (on average 1.4490861618798956) internal successors, (555), 385 states have internal predecessors, (555), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:49:21,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 567 transitions. [2025-02-08 13:49:21,524 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 567 transitions. Word has length 6 [2025-02-08 13:49:21,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:21,524 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 567 transitions. [2025-02-08 13:49:21,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:49:21,525 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 567 transitions. [2025-02-08 13:49:21,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 13:49:21,525 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:21,525 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:49:21,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:49:21,525 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:49:21,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:21,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1156612759, now seen corresponding path program 1 times [2025-02-08 13:49:21,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:21,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484499458] [2025-02-08 13:49:21,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:21,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:21,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:49:21,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:49:21,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:21,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 13:49:21,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1674754789] [2025-02-08 13:49:21,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:21,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:49:21,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:49:21,553 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:21,554 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:21,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:49:21,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:49:21,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:21,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:21,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:49:21,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:49:21,695 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:21,695 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:49:21,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:21,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484499458] [2025-02-08 13:49:21,696 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 13:49:21,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674754789] [2025-02-08 13:49:21,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674754789] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:21,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:49:21,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:49:21,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950168647] [2025-02-08 13:49:21,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:21,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:49:21,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:21,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:49:21,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:49:21,702 INFO L87 Difference]: Start difference. First operand 393 states and 567 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:49:21,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:21,847 INFO L93 Difference]: Finished difference Result 776 states and 1124 transitions. [2025-02-08 13:49:21,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:49:21,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 13:49:21,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:21,850 INFO L225 Difference]: With dead ends: 776 [2025-02-08 13:49:21,850 INFO L226 Difference]: Without dead ends: 775 [2025-02-08 13:49:21,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:49:21,853 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 539 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:21,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1036 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:49:21,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2025-02-08 13:49:21,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 398. [2025-02-08 13:49:21,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 388 states have (on average 1.443298969072165) internal successors, (560), 390 states have internal predecessors, (560), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:49:21,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 572 transitions. [2025-02-08 13:49:21,879 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 572 transitions. Word has length 7 [2025-02-08 13:49:21,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:21,879 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 572 transitions. [2025-02-08 13:49:21,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:49:21,879 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 572 transitions. [2025-02-08 13:49:21,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-08 13:49:21,883 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:21,883 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:49:21,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 13:49:22,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:49:22,085 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:49:22,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:22,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1643253815, now seen corresponding path program 1 times [2025-02-08 13:49:22,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:22,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116413325] [2025-02-08 13:49:22,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:22,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:22,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-08 13:49:22,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-08 13:49:22,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:22,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:22,728 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:22,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:22,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116413325] [2025-02-08 13:49:22,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116413325] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:22,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:49:22,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:49:22,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469614672] [2025-02-08 13:49:22,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:22,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:49:22,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:22,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:49:22,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:49:22,730 INFO L87 Difference]: Start difference. First operand 398 states and 572 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:49:22,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:22,867 INFO L93 Difference]: Finished difference Result 792 states and 1140 transitions. [2025-02-08 13:49:22,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:49:22,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2025-02-08 13:49:22,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:22,869 INFO L225 Difference]: With dead ends: 792 [2025-02-08 13:49:22,869 INFO L226 Difference]: Without dead ends: 401 [2025-02-08 13:49:22,871 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:22,871 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 105 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:22,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1404 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:49:22,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-02-08 13:49:22,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 398. [2025-02-08 13:49:22,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 388 states have (on average 1.425257731958763) internal successors, (553), 390 states have internal predecessors, (553), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:49:22,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 565 transitions. [2025-02-08 13:49:22,880 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 565 transitions. Word has length 149 [2025-02-08 13:49:22,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:22,881 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 565 transitions. [2025-02-08 13:49:22,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:49:22,881 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 565 transitions. [2025-02-08 13:49:22,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-08 13:49:22,884 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:22,884 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:49:22,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:49:22,884 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:49:22,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:22,885 INFO L85 PathProgramCache]: Analyzing trace with hash -379992637, now seen corresponding path program 1 times [2025-02-08 13:49:22,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:22,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811226764] [2025-02-08 13:49:22,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:22,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:22,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-08 13:49:22,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-08 13:49:22,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:22,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:23,118 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:23,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:23,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811226764] [2025-02-08 13:49:23,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811226764] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:23,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:49:23,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:49:23,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014587092] [2025-02-08 13:49:23,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:23,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:49:23,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:23,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:49:23,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:49:23,119 INFO L87 Difference]: Start difference. First operand 398 states and 565 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:49:23,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:23,236 INFO L93 Difference]: Finished difference Result 915 states and 1309 transitions. [2025-02-08 13:49:23,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:49:23,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2025-02-08 13:49:23,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:23,238 INFO L225 Difference]: With dead ends: 915 [2025-02-08 13:49:23,238 INFO L226 Difference]: Without dead ends: 524 [2025-02-08 13:49:23,239 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:23,239 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 134 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:23,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1022 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:49:23,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-02-08 13:49:23,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2025-02-08 13:49:23,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 514 states have (on average 1.4357976653696498) internal successors, (738), 516 states have internal predecessors, (738), 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:23,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 750 transitions. [2025-02-08 13:49:23,250 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 750 transitions. Word has length 149 [2025-02-08 13:49:23,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:23,250 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 750 transitions. [2025-02-08 13:49:23,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:49:23,251 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 750 transitions. [2025-02-08 13:49:23,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-08 13:49:23,252 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:23,252 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:49:23,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 13:49:23,252 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:49:23,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:23,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1889335027, now seen corresponding path program 1 times [2025-02-08 13:49:23,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:23,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305044236] [2025-02-08 13:49:23,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:23,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:23,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-08 13:49:23,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-08 13:49:23,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:23,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:23,656 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:23,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:23,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305044236] [2025-02-08 13:49:23,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305044236] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:23,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:49:23,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 13:49:23,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240623229] [2025-02-08 13:49:23,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:23,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:49:23,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:23,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:49:23,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:49:23,660 INFO L87 Difference]: Start difference. First operand 524 states and 750 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:49:23,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:23,778 INFO L93 Difference]: Finished difference Result 873 states and 1242 transitions. [2025-02-08 13:49:23,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:49:23,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 164 [2025-02-08 13:49:23,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:23,782 INFO L225 Difference]: With dead ends: 873 [2025-02-08 13:49:23,782 INFO L226 Difference]: Without dead ends: 482 [2025-02-08 13:49:23,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:49:23,783 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 27 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:23,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1253 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:49:23,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-02-08 13:49:23,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2025-02-08 13:49:23,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 472 states have (on average 1.4004237288135593) internal successors, (661), 474 states have internal predecessors, (661), 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:23,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 673 transitions. [2025-02-08 13:49:23,798 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 673 transitions. Word has length 164 [2025-02-08 13:49:23,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:23,799 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 673 transitions. [2025-02-08 13:49:23,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:49:23,800 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 673 transitions. [2025-02-08 13:49:23,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-08 13:49:23,801 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:23,802 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:49:23,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 13:49:23,802 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:49:23,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:23,802 INFO L85 PathProgramCache]: Analyzing trace with hash -2121062419, now seen corresponding path program 1 times [2025-02-08 13:49:23,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:23,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209040363] [2025-02-08 13:49:23,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:23,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:23,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-08 13:49:23,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-08 13:49:23,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:23,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:24,026 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:24,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:24,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209040363] [2025-02-08 13:49:24,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209040363] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:24,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:49:24,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:49:24,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416827070] [2025-02-08 13:49:24,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:24,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:49:24,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:24,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:49:24,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:49:24,027 INFO L87 Difference]: Start difference. First operand 482 states and 673 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:49:24,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:24,137 INFO L93 Difference]: Finished difference Result 975 states and 1350 transitions. [2025-02-08 13:49:24,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:49:24,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 164 [2025-02-08 13:49:24,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:24,140 INFO L225 Difference]: With dead ends: 975 [2025-02-08 13:49:24,140 INFO L226 Difference]: Without dead ends: 626 [2025-02-08 13:49:24,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:49:24,141 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 242 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:24,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 874 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:49:24,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-02-08 13:49:24,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2025-02-08 13:49:24,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 613 states have (on average 1.3866231647634584) internal successors, (850), 615 states have internal predecessors, (850), 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:24,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 868 transitions. [2025-02-08 13:49:24,153 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 868 transitions. Word has length 164 [2025-02-08 13:49:24,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:24,154 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 868 transitions. [2025-02-08 13:49:24,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:49:24,154 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 868 transitions. [2025-02-08 13:49:24,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-08 13:49:24,155 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:24,155 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:49:24,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:49:24,155 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:49:24,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:24,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1370132417, now seen corresponding path program 1 times [2025-02-08 13:49:24,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:24,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105031225] [2025-02-08 13:49:24,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:24,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:24,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-08 13:49:24,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-08 13:49:24,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:24,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:24,465 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 13:49:24,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:24,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105031225] [2025-02-08 13:49:24,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105031225] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:24,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:49:24,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:49:24,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512698678] [2025-02-08 13:49:24,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:24,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:49:24,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:24,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:49:24,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:49:24,467 INFO L87 Difference]: Start difference. First operand 626 states and 868 transitions. Second operand has 4 states, 3 states have (on average 54.0) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:49:24,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:24,702 INFO L93 Difference]: Finished difference Result 691 states and 953 transitions. [2025-02-08 13:49:24,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:49:24,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 54.0) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 179 [2025-02-08 13:49:24,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:24,706 INFO L225 Difference]: With dead ends: 691 [2025-02-08 13:49:24,706 INFO L226 Difference]: Without dead ends: 689 [2025-02-08 13:49:24,707 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:24,707 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 293 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1377 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:24,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1377 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:49:24,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-02-08 13:49:24,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2025-02-08 13:49:24,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 673 states have (on average 1.3774145616641902) internal successors, (927), 675 states have internal predecessors, (927), 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:24,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 951 transitions. [2025-02-08 13:49:24,728 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 951 transitions. Word has length 179 [2025-02-08 13:49:24,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:24,728 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 951 transitions. [2025-02-08 13:49:24,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 54.0) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:49:24,729 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 951 transitions. [2025-02-08 13:49:24,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-02-08 13:49:24,730 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:24,731 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:49:24,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:49:24,731 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:49:24,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:24,731 INFO L85 PathProgramCache]: Analyzing trace with hash 2063090581, now seen corresponding path program 1 times [2025-02-08 13:49:24,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:24,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502650474] [2025-02-08 13:49:24,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:24,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:24,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-08 13:49:25,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-08 13:49:25,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:25,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:25,600 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 13:49:25,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:25,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502650474] [2025-02-08 13:49:25,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502650474] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:49:25,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494548701] [2025-02-08 13:49:25,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:25,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:49:25,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:49:25,605 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:25,605 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:25,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-08 13:49:26,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-08 13:49:26,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:26,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:26,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-08 13:49:26,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:49:26,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 13:49:26,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 13:49:26,744 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 13:49:26,744 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:49:26,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494548701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:26,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:49:26,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-02-08 13:49:26,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630168511] [2025-02-08 13:49:26,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:26,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 13:49:26,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:26,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 13:49:26,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-08 13:49:26,748 INFO L87 Difference]: Start difference. First operand 689 states and 951 transitions. Second operand has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 11 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:49:28,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:28,915 INFO L93 Difference]: Finished difference Result 1340 states and 1843 transitions. [2025-02-08 13:49:28,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 13:49:28,915 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 11 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 185 [2025-02-08 13:49:28,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:28,918 INFO L225 Difference]: With dead ends: 1340 [2025-02-08 13:49:28,918 INFO L226 Difference]: Without dead ends: 737 [2025-02-08 13:49:28,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-02-08 13:49:28,919 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 722 mSDsluCounter, 2155 mSDsCounter, 0 mSdLazyCounter, 1336 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 2592 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:28,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 2592 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1336 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-08 13:49:28,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2025-02-08 13:49:28,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 714. [2025-02-08 13:49:28,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 698 states have (on average 1.3710601719197708) internal successors, (957), 700 states have internal predecessors, (957), 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:28,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 981 transitions. [2025-02-08 13:49:28,934 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 981 transitions. Word has length 185 [2025-02-08 13:49:28,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:28,934 INFO L471 AbstractCegarLoop]: Abstraction has 714 states and 981 transitions. [2025-02-08 13:49:28,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 11 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:49:28,935 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 981 transitions. [2025-02-08 13:49:28,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-02-08 13:49:28,936 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:28,936 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:49:28,945 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:29,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:49:29,140 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:49:29,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:29,140 INFO L85 PathProgramCache]: Analyzing trace with hash -769509661, now seen corresponding path program 1 times [2025-02-08 13:49:29,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:29,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907678826] [2025-02-08 13:49:29,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:29,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:29,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-08 13:49:29,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-08 13:49:29,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:29,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:29,856 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 13:49:29,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:29,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907678826] [2025-02-08 13:49:29,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907678826] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:49:29,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803699947] [2025-02-08 13:49:29,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:29,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:49:29,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:49:29,858 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:29,860 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:30,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-08 13:49:30,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-08 13:49:30,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:30,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:30,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 13:49:30,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:49:30,475 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 13:49:30,475 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:49:30,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803699947] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:30,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:49:30,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 6 [2025-02-08 13:49:30,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109911785] [2025-02-08 13:49:30,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:30,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:49:30,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:30,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:49:30,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:49:30,477 INFO L87 Difference]: Start difference. First operand 714 states and 981 transitions. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 13:49:30,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:30,645 INFO L93 Difference]: Finished difference Result 1270 states and 1751 transitions. [2025-02-08 13:49:30,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:49:30,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 186 [2025-02-08 13:49:30,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:30,649 INFO L225 Difference]: With dead ends: 1270 [2025-02-08 13:49:30,650 INFO L226 Difference]: Without dead ends: 717 [2025-02-08 13:49:30,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:49:30,651 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 447 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 1721 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:30,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 1721 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:49:30,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2025-02-08 13:49:30,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2025-02-08 13:49:30,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 700 states have (on average 1.3714285714285714) internal successors, (960), 703 states have internal predecessors, (960), 12 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2025-02-08 13:49:30,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 988 transitions. [2025-02-08 13:49:30,670 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 988 transitions. Word has length 186 [2025-02-08 13:49:30,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:30,670 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 988 transitions. [2025-02-08 13:49:30,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 13:49:30,671 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 988 transitions. [2025-02-08 13:49:30,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-08 13:49:30,672 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:30,672 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:49:30,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 13:49:30,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:49:30,874 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:49:30,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:30,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1958627037, now seen corresponding path program 1 times [2025-02-08 13:49:30,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:30,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873603409] [2025-02-08 13:49:30,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:30,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:30,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-08 13:49:31,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-08 13:49:31,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:31,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:31,859 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-08 13:49:31,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:31,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873603409] [2025-02-08 13:49:31,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873603409] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:49:31,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218540390] [2025-02-08 13:49:31,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:31,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:49:31,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:49:31,862 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:31,863 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:32,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-08 13:49:32,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-08 13:49:32,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:32,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:32,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 1099 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-08 13:49:32,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:49:32,361 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-08 13:49:32,362 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:49:32,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218540390] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:32,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:49:32,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-02-08 13:49:32,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531994844] [2025-02-08 13:49:32,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:32,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:49:32,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:32,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:49:32,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:49:32,364 INFO L87 Difference]: Start difference. First operand 717 states and 988 transitions. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:49:32,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:32,565 INFO L93 Difference]: Finished difference Result 1366 states and 1884 transitions. [2025-02-08 13:49:32,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:49:32,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 190 [2025-02-08 13:49:32,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:32,568 INFO L225 Difference]: With dead ends: 1366 [2025-02-08 13:49:32,568 INFO L226 Difference]: Without dead ends: 760 [2025-02-08 13:49:32,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 189 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:32,569 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 17 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:32,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1136 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:49:32,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2025-02-08 13:49:32,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 744. [2025-02-08 13:49:32,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 727 states have (on average 1.3658872077028885) internal successors, (993), 730 states have internal predecessors, (993), 12 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2025-02-08 13:49:32,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1021 transitions. [2025-02-08 13:49:32,588 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1021 transitions. Word has length 190 [2025-02-08 13:49:32,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:32,588 INFO L471 AbstractCegarLoop]: Abstraction has 744 states and 1021 transitions. [2025-02-08 13:49:32,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:49:32,588 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1021 transitions. [2025-02-08 13:49:32,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-02-08 13:49:32,589 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:32,589 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:49:32,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 13:49:32,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-08 13:49:32,790 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:49:32,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:32,790 INFO L85 PathProgramCache]: Analyzing trace with hash 87914648, now seen corresponding path program 1 times [2025-02-08 13:49:32,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:32,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798290658] [2025-02-08 13:49:32,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:32,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:32,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-08 13:49:32,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-08 13:49:32,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:32,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:33,104 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-08 13:49:33,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:33,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798290658] [2025-02-08 13:49:33,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798290658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:49:33,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:49:33,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 13:49:33,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672875612] [2025-02-08 13:49:33,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:49:33,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:49:33,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:49:33,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:49:33,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:49:33,106 INFO L87 Difference]: Start difference. First operand 744 states and 1021 transitions. Second operand has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:49:33,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:49:33,514 INFO L93 Difference]: Finished difference Result 1385 states and 1903 transitions. [2025-02-08 13:49:33,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:49:33,514 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 191 [2025-02-08 13:49:33,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:49:33,517 INFO L225 Difference]: With dead ends: 1385 [2025-02-08 13:49:33,517 INFO L226 Difference]: Without dead ends: 756 [2025-02-08 13:49:33,520 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:33,521 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 8 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 13:49:33,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1693 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 13:49:33,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2025-02-08 13:49:33,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 752. [2025-02-08 13:49:33,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 735 states have (on average 1.364625850340136) internal successors, (1003), 738 states have internal predecessors, (1003), 12 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2025-02-08 13:49:33,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1031 transitions. [2025-02-08 13:49:33,552 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1031 transitions. Word has length 191 [2025-02-08 13:49:33,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:49:33,560 INFO L471 AbstractCegarLoop]: Abstraction has 752 states and 1031 transitions. [2025-02-08 13:49:33,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 13:49:33,564 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1031 transitions. [2025-02-08 13:49:33,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-08 13:49:33,576 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:49:33,576 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:49:33,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 13:49:33,576 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 13:49:33,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:49:33,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1196818810, now seen corresponding path program 1 times [2025-02-08 13:49:33,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:49:33,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710958684] [2025-02-08 13:49:33,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:33,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:49:33,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-08 13:49:34,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-08 13:49:34,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:34,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:34,576 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-08 13:49:34,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:49:34,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710958684] [2025-02-08 13:49:34,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710958684] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:49:34,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319788651] [2025-02-08 13:49:34,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:49:34,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:49:34,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:49:34,580 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:34,580 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:34,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-08 13:49:35,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-08 13:49:35,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:49:35,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:49:35,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 1098 conjuncts, 149 conjuncts are in the unsatisfiable core [2025-02-08 13:49:35,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:49:35,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 13:49:35,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 13:49:35,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 11 [2025-02-08 13:49:35,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-08 13:49:35,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-08 13:49:35,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-08 13:49:35,572 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-02-08 13:49:35,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2025-02-08 13:49:35,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 13:49:35,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 13:49:35,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-02-08 13:49:35,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-08 13:49:35,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-08 13:49:35,796 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:49:35,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 57 [2025-02-08 13:49:35,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-08 13:49:35,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-08 13:50:13,942 INFO L224 Elim1Store]: Index analysis took 868 ms