./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.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 ec355916cf6ee76d4008e84bb2b3ecc632256e3b320d2f47b453f4ca1f46acbc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:34:22,235 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:34:22,290 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:34:22,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:34:22,294 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:34:22,314 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:34:22,314 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:34:22,314 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:34:22,315 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:34:22,315 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:34:22,315 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:34:22,315 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:34:22,315 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:34:22,315 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:34:22,315 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:34:22,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:34:22,315 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:34:22,315 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:34:22,315 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:34:22,315 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:34:22,316 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:34:22,316 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:34:22,316 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:34:22,316 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:34:22,316 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:34:22,316 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:34:22,316 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:34:22,316 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:34:22,316 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:34:22,316 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:34:22,316 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:34:22,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:34:22,316 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:34:22,316 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:34:22,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:34:22,317 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:34:22,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:34:22,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:34:22,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:34:22,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:34:22,317 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:34:22,317 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:34:22,317 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:34:22,317 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:34:22,317 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:34:22,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:34:22,317 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:34:22,317 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:34:22,317 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:34:22,317 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:34:22,317 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 -> ec355916cf6ee76d4008e84bb2b3ecc632256e3b320d2f47b453f4ca1f46acbc [2025-01-10 06:34:22,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:34:22,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:34:22,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:34:22,601 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:34:22,601 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:34:22,602 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2025-01-10 06:34:23,775 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7523878e5/9266819af5b140e5a225c0bffc9805b4/FLAGa00514f54 [2025-01-10 06:34:24,026 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:34:24,027 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2025-01-10 06:34:24,036 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7523878e5/9266819af5b140e5a225c0bffc9805b4/FLAGa00514f54 [2025-01-10 06:34:24,345 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7523878e5/9266819af5b140e5a225c0bffc9805b4 [2025-01-10 06:34:24,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:34:24,348 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:34:24,349 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:34:24,349 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:34:24,352 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:34:24,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:34:24" (1/1) ... [2025-01-10 06:34:24,353 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f4578ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:24, skipping insertion in model container [2025-01-10 06:34:24,353 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:34:24" (1/1) ... [2025-01-10 06:34:24,382 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:34:24,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:34:24,654 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:34:24,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:34:24,728 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:34:24,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:24 WrapperNode [2025-01-10 06:34:24,730 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:34:24,731 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:34:24,731 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:34:24,731 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:34:24,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:24" (1/1) ... [2025-01-10 06:34:24,744 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:24" (1/1) ... [2025-01-10 06:34:24,758 INFO L138 Inliner]: procedures = 164, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 97 [2025-01-10 06:34:24,758 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:34:24,759 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:34:24,759 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:34:24,759 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:34:24,764 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:24" (1/1) ... [2025-01-10 06:34:24,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:24" (1/1) ... [2025-01-10 06:34:24,766 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:24" (1/1) ... [2025-01-10 06:34:24,774 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 5, 8]. 53 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 1 writes are split as follows [0, 0, 1]. [2025-01-10 06:34:24,775 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:24" (1/1) ... [2025-01-10 06:34:24,775 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:24" (1/1) ... [2025-01-10 06:34:24,778 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:24" (1/1) ... [2025-01-10 06:34:24,779 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:24" (1/1) ... [2025-01-10 06:34:24,781 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:24" (1/1) ... [2025-01-10 06:34:24,782 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:24" (1/1) ... [2025-01-10 06:34:24,783 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:24" (1/1) ... [2025-01-10 06:34:24,784 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:34:24,785 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:34:24,785 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:34:24,785 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:34:24,785 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:24" (1/1) ... [2025-01-10 06:34:24,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:34:24,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:34:24,810 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:34:24,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:34:24,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:34:24,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:34:24,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:34:24,830 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-10 06:34:24,830 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-10 06:34:24,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:34:24,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:34:24,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:34:24,830 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 06:34:24,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:34:24,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:34:24,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:34:24,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:34:24,830 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 06:34:24,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:34:24,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:34:24,831 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:34:24,919 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:34:24,922 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:34:25,107 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:34:25,107 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:34:25,219 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:34:25,220 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 06:34:25,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:34:25 BoogieIcfgContainer [2025-01-10 06:34:25,220 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:34:25,222 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:34:25,222 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:34:25,225 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:34:25,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:34:24" (1/3) ... [2025-01-10 06:34:25,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c6fb9cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:34:25, skipping insertion in model container [2025-01-10 06:34:25,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:24" (2/3) ... [2025-01-10 06:34:25,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c6fb9cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:34:25, skipping insertion in model container [2025-01-10 06:34:25,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:34:25" (3/3) ... [2025-01-10 06:34:25,228 INFO L128 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt.i [2025-01-10 06:34:25,239 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:34:25,241 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 11_fmaxsymopt.i that has 2 procedures, 32 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-01-10 06:34:25,241 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:34:25,277 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:34:25,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 37 transitions, 78 flow [2025-01-10 06:34:25,326 INFO L124 PetriNetUnfolderBase]: 5/39 cut-off events. [2025-01-10 06:34:25,329 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:34:25,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 39 events. 5/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 75 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2025-01-10 06:34:25,332 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 37 transitions, 78 flow [2025-01-10 06:34:25,335 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 37 transitions, 78 flow [2025-01-10 06:34:25,340 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:34:25,350 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;@1a4e869b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:34:25,350 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-01-10 06:34:25,354 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:34:25,355 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 06:34:25,355 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:34:25,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:25,356 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 06:34:25,356 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 06:34:25,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:25,360 INFO L85 PathProgramCache]: Analyzing trace with hash 305294, now seen corresponding path program 1 times [2025-01-10 06:34:25,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:25,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027194911] [2025-01-10 06:34:25,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:25,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:25,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:34:25,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:34:25,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:25,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:25,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:25,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:25,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027194911] [2025-01-10 06:34:25,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027194911] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:25,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:25,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:25,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502820414] [2025-01-10 06:34:25,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:25,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:34:25,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:25,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:34:25,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:34:25,638 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2025-01-10 06:34:25,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 37 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-01-10 06:34:25,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:25,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2025-01-10 06:34:25,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:25,722 INFO L124 PetriNetUnfolderBase]: 23/93 cut-off events. [2025-01-10 06:34:25,722 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:34:25,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 93 events. 23/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 240 event pairs, 18 based on Foata normal form. 8/87 useless extension candidates. Maximal degree in co-relation 127. Up to 59 conditions per place. [2025-01-10 06:34:25,724 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 18 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2025-01-10 06:34:25,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 36 transitions, 118 flow [2025-01-10 06:34:25,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:34:25,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:34:25,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-01-10 06:34:25,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5878378378378378 [2025-01-10 06:34:25,735 INFO L175 Difference]: Start difference. First operand has 35 places, 37 transitions, 78 flow. Second operand 4 states and 87 transitions. [2025-01-10 06:34:25,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 36 transitions, 118 flow [2025-01-10 06:34:25,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 36 transitions, 118 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:34:25,740 INFO L231 Difference]: Finished difference. Result has 39 places, 36 transitions, 96 flow [2025-01-10 06:34:25,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=39, PETRI_TRANSITIONS=36} [2025-01-10 06:34:25,744 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2025-01-10 06:34:25,745 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 96 flow [2025-01-10 06:34:25,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-01-10 06:34:25,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:25,745 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 06:34:25,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:34:25,745 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 06:34:25,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:25,746 INFO L85 PathProgramCache]: Analyzing trace with hash 505370802, now seen corresponding path program 1 times [2025-01-10 06:34:25,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:25,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428150412] [2025-01-10 06:34:25,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:25,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:25,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:34:25,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:34:25,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:25,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:25,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:25,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:25,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428150412] [2025-01-10 06:34:25,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428150412] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:34:25,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656086963] [2025-01-10 06:34:25,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:25,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:34:25,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:34:25,880 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:34:25,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 06:34:25,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:34:25,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:34:25,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:25,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:25,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:34:25,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:34:25,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:25,982 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:34:25,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656086963] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:25,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:34:25,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 06:34:25,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502561805] [2025-01-10 06:34:25,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:25,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:34:25,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:25,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:34:25,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:34:25,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2025-01-10 06:34:25,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 96 flow. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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-01-10 06:34:25,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:25,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2025-01-10 06:34:25,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:26,080 INFO L124 PetriNetUnfolderBase]: 23/92 cut-off events. [2025-01-10 06:34:26,080 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:34:26,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 92 events. 23/92 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 244 event pairs, 18 based on Foata normal form. 1/79 useless extension candidates. Maximal degree in co-relation 150. Up to 54 conditions per place. [2025-01-10 06:34:26,081 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 14 selfloop transitions, 6 changer transitions 0/35 dead transitions. [2025-01-10 06:34:26,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 35 transitions, 132 flow [2025-01-10 06:34:26,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:34:26,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:34:26,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2025-01-10 06:34:26,084 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-01-10 06:34:26,084 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 96 flow. Second operand 6 states and 111 transitions. [2025-01-10 06:34:26,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 35 transitions, 132 flow [2025-01-10 06:34:26,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 35 transitions, 130 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:34:26,085 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 102 flow [2025-01-10 06:34:26,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=102, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2025-01-10 06:34:26,086 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2025-01-10 06:34:26,086 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 102 flow [2025-01-10 06:34:26,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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-01-10 06:34:26,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:26,086 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-01-10 06:34:26,097 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-01-10 06:34:26,292 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-01-10 06:34:26,292 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 06:34:26,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:26,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1513374028, now seen corresponding path program 1 times [2025-01-10 06:34:26,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:26,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837452547] [2025-01-10 06:34:26,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:26,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:26,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:34:26,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:34:26,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:26,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:26,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:34:26,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:26,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837452547] [2025-01-10 06:34:26,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837452547] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:26,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:26,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:26,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301291696] [2025-01-10 06:34:26,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:26,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:26,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:26,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:26,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:26,354 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2025-01-10 06:34:26,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-01-10 06:34:26,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:26,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2025-01-10 06:34:26,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:26,409 INFO L124 PetriNetUnfolderBase]: 23/91 cut-off events. [2025-01-10 06:34:26,410 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 06:34:26,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 91 events. 23/91 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 246 event pairs, 18 based on Foata normal form. 1/79 useless extension candidates. Maximal degree in co-relation 146. Up to 57 conditions per place. [2025-01-10 06:34:26,410 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 15 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2025-01-10 06:34:26,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 34 transitions, 136 flow [2025-01-10 06:34:26,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:26,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:26,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2025-01-10 06:34:26,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5675675675675675 [2025-01-10 06:34:26,412 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 102 flow. Second operand 3 states and 63 transitions. [2025-01-10 06:34:26,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 34 transitions, 136 flow [2025-01-10 06:34:26,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 34 transitions, 114 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-01-10 06:34:26,413 INFO L231 Difference]: Finished difference. Result has 37 places, 34 transitions, 84 flow [2025-01-10 06:34:26,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=37, PETRI_TRANSITIONS=34} [2025-01-10 06:34:26,413 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2025-01-10 06:34:26,413 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 34 transitions, 84 flow [2025-01-10 06:34:26,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-01-10 06:34:26,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:26,414 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:26,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:34:26,414 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 06:34:26,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:26,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1642037112, now seen corresponding path program 1 times [2025-01-10 06:34:26,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:26,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336024951] [2025-01-10 06:34:26,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:26,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:26,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:34:26,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:34:26,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:26,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:26,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:26,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:26,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336024951] [2025-01-10 06:34:26,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336024951] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:34:26,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798590168] [2025-01-10 06:34:26,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:26,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:34:26,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:34:26,488 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:34:26,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 06:34:26,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:34:26,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:34:26,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:26,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:26,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:34:26,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:34:26,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:26,597 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:34:26,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:26,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798590168] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:34:26,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:34:26,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-10 06:34:26,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057520089] [2025-01-10 06:34:26,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:34:26,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:34:26,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:26,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:34:26,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:34:26,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2025-01-10 06:34:26,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 34 transitions, 84 flow. Second operand has 10 states, 10 states have (on average 16.4) internal successors, (164), 10 states have internal predecessors, (164), 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-01-10 06:34:26,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:26,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2025-01-10 06:34:26,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:26,732 INFO L124 PetriNetUnfolderBase]: 23/95 cut-off events. [2025-01-10 06:34:26,732 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-01-10 06:34:26,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 95 events. 23/95 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 238 event pairs, 18 based on Foata normal form. 2/85 useless extension candidates. Maximal degree in co-relation 139. Up to 55 conditions per place. [2025-01-10 06:34:26,733 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 15 selfloop transitions, 7 changer transitions 0/37 dead transitions. [2025-01-10 06:34:26,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 37 transitions, 143 flow [2025-01-10 06:34:26,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:34:26,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:34:26,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2025-01-10 06:34:26,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4980694980694981 [2025-01-10 06:34:26,734 INFO L175 Difference]: Start difference. First operand has 37 places, 34 transitions, 84 flow. Second operand 7 states and 129 transitions. [2025-01-10 06:34:26,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 37 transitions, 143 flow [2025-01-10 06:34:26,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 129 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:26,735 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 110 flow [2025-01-10 06:34:26,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=110, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2025-01-10 06:34:26,736 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 8 predicate places. [2025-01-10 06:34:26,736 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 110 flow [2025-01-10 06:34:26,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.4) internal successors, (164), 10 states have internal predecessors, (164), 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-01-10 06:34:26,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:26,736 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:26,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 06:34:26,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:34:26,937 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 06:34:26,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:26,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1261060872, now seen corresponding path program 2 times [2025-01-10 06:34:26,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:26,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513845417] [2025-01-10 06:34:26,938 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:34:26,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:26,945 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-10 06:34:26,951 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 15 statements. [2025-01-10 06:34:26,951 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:34:26,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:26,998 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 06:34:26,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:26,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513845417] [2025-01-10 06:34:26,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513845417] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:26,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:26,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:27,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794137554] [2025-01-10 06:34:27,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:27,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:27,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:27,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:27,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:27,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2025-01-10 06:34:27,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-01-10 06:34:27,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:27,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2025-01-10 06:34:27,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:27,053 INFO L124 PetriNetUnfolderBase]: 27/104 cut-off events. [2025-01-10 06:34:27,054 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-10 06:34:27,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 104 events. 27/104 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 252 event pairs, 2 based on Foata normal form. 3/101 useless extension candidates. Maximal degree in co-relation 155. Up to 48 conditions per place. [2025-01-10 06:34:27,054 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 23 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2025-01-10 06:34:27,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 38 transitions, 162 flow [2025-01-10 06:34:27,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:27,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:27,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-01-10 06:34:27,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5945945945945946 [2025-01-10 06:34:27,056 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 110 flow. Second operand 3 states and 66 transitions. [2025-01-10 06:34:27,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 38 transitions, 162 flow [2025-01-10 06:34:27,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 38 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:27,057 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 108 flow [2025-01-10 06:34:27,057 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2025-01-10 06:34:27,058 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2025-01-10 06:34:27,058 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 108 flow [2025-01-10 06:34:27,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-01-10 06:34:27,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:27,058 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-01-10 06:34:27,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:34:27,058 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 06:34:27,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:27,060 INFO L85 PathProgramCache]: Analyzing trace with hash -438206599, now seen corresponding path program 1 times [2025-01-10 06:34:27,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:27,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401056108] [2025-01-10 06:34:27,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:27,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:27,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:34:27,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:34:27,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:27,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:27,171 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:27,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:27,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401056108] [2025-01-10 06:34:27,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401056108] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:34:27,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200854631] [2025-01-10 06:34:27,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:27,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:34:27,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:34:27,173 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:34:27,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 06:34:27,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:34:27,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:34:27,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:27,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:27,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 06:34:27,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:34:27,253 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:27,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:34:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:27,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200854631] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:34:27,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:34:27,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-01-10 06:34:27,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354554783] [2025-01-10 06:34:27,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:34:27,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 06:34:27,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:27,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 06:34:27,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-01-10 06:34:27,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2025-01-10 06:34:27,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 108 flow. Second operand has 15 states, 15 states have (on average 16.333333333333332) internal successors, (245), 15 states have internal predecessors, (245), 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-01-10 06:34:27,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:27,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2025-01-10 06:34:27,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:27,457 INFO L124 PetriNetUnfolderBase]: 23/103 cut-off events. [2025-01-10 06:34:27,458 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-01-10 06:34:27,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 103 events. 23/103 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 230 event pairs, 18 based on Foata normal form. 3/95 useless extension candidates. Maximal degree in co-relation 146. Up to 55 conditions per place. [2025-01-10 06:34:27,458 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 15 selfloop transitions, 13 changer transitions 0/42 dead transitions. [2025-01-10 06:34:27,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 42 transitions, 200 flow [2025-01-10 06:34:27,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 06:34:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 06:34:27,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 226 transitions. [2025-01-10 06:34:27,462 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4698544698544699 [2025-01-10 06:34:27,463 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 108 flow. Second operand 13 states and 226 transitions. [2025-01-10 06:34:27,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 42 transitions, 200 flow [2025-01-10 06:34:27,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 42 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:27,464 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 181 flow [2025-01-10 06:34:27,464 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=181, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2025-01-10 06:34:27,465 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 20 predicate places. [2025-01-10 06:34:27,465 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 181 flow [2025-01-10 06:34:27,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 16.333333333333332) internal successors, (245), 15 states have internal predecessors, (245), 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-01-10 06:34:27,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:27,465 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1] [2025-01-10 06:34:27,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 06:34:27,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:34:27,666 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 06:34:27,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:27,666 INFO L85 PathProgramCache]: Analyzing trace with hash -935557291, now seen corresponding path program 2 times [2025-01-10 06:34:27,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:27,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968223391] [2025-01-10 06:34:27,666 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:34:27,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:27,676 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-10 06:34:27,685 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 06:34:27,685 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:34:27,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:34:27,685 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:34:27,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 06:34:27,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 06:34:27,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:27,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:34:27,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:34:27,713 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:34:27,714 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-01-10 06:34:27,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 11 remaining) [2025-01-10 06:34:27,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 11 remaining) [2025-01-10 06:34:27,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 11 remaining) [2025-01-10 06:34:27,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 11 remaining) [2025-01-10 06:34:27,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 11 remaining) [2025-01-10 06:34:27,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 11 remaining) [2025-01-10 06:34:27,717 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 11 remaining) [2025-01-10 06:34:27,717 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 11 remaining) [2025-01-10 06:34:27,717 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 11 remaining) [2025-01-10 06:34:27,717 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 11 remaining) [2025-01-10 06:34:27,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:34:27,717 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2025-01-10 06:34:27,719 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:34:27,719 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 06:34:27,741 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:34:27,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 63 transitions, 136 flow [2025-01-10 06:34:27,751 INFO L124 PetriNetUnfolderBase]: 9/68 cut-off events. [2025-01-10 06:34:27,751 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:34:27,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 68 events. 9/68 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 204 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 53. Up to 3 conditions per place. [2025-01-10 06:34:27,751 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 63 transitions, 136 flow [2025-01-10 06:34:27,752 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 63 transitions, 136 flow [2025-01-10 06:34:27,752 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:34:27,754 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;@1a4e869b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:34:27,754 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-01-10 06:34:27,755 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:34:27,755 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 06:34:27,755 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:34:27,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:27,755 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 06:34:27,755 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-01-10 06:34:27,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:27,755 INFO L85 PathProgramCache]: Analyzing trace with hash 367853, now seen corresponding path program 1 times [2025-01-10 06:34:27,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:27,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455280383] [2025-01-10 06:34:27,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:27,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:27,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:34:27,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:34:27,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:27,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:27,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:27,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:27,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455280383] [2025-01-10 06:34:27,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455280383] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:27,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:27,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:27,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552689762] [2025-01-10 06:34:27,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:27,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:34:27,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:27,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:34:27,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:34:27,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 63 [2025-01-10 06:34:27,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 63 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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-01-10 06:34:27,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:27,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 63 [2025-01-10 06:34:27,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:27,922 INFO L124 PetriNetUnfolderBase]: 547/1260 cut-off events. [2025-01-10 06:34:27,922 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-01-10 06:34:27,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2166 conditions, 1260 events. 547/1260 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7817 event pairs, 468 based on Foata normal form. 156/1263 useless extension candidates. Maximal degree in co-relation 1071. Up to 869 conditions per place. [2025-01-10 06:34:27,930 INFO L140 encePairwiseOnDemand]: 52/63 looper letters, 29 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2025-01-10 06:34:27,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 60 transitions, 194 flow [2025-01-10 06:34:27,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:34:27,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:34:27,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 152 transitions. [2025-01-10 06:34:27,931 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2025-01-10 06:34:27,931 INFO L175 Difference]: Start difference. First operand has 59 places, 63 transitions, 136 flow. Second operand 4 states and 152 transitions. [2025-01-10 06:34:27,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 60 transitions, 194 flow [2025-01-10 06:34:27,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 194 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:34:27,933 INFO L231 Difference]: Finished difference. Result has 63 places, 60 transitions, 150 flow [2025-01-10 06:34:27,933 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=63, PETRI_TRANSITIONS=60} [2025-01-10 06:34:27,933 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 4 predicate places. [2025-01-10 06:34:27,933 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 60 transitions, 150 flow [2025-01-10 06:34:27,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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-01-10 06:34:27,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:27,933 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 06:34:27,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:34:27,934 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-01-10 06:34:27,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:27,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1925838766, now seen corresponding path program 1 times [2025-01-10 06:34:27,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:27,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524212067] [2025-01-10 06:34:27,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:27,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:27,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:34:27,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:34:27,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:27,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:27,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:27,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:27,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524212067] [2025-01-10 06:34:27,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524212067] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:34:27,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703903233] [2025-01-10 06:34:27,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:27,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:34:27,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:34:28,001 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:34:28,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 06:34:28,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:34:28,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:34:28,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:28,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:28,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:34:28,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:34:28,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:28,078 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:34:28,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703903233] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:28,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:34:28,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 06:34:28,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781166720] [2025-01-10 06:34:28,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:28,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:34:28,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:28,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:34:28,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:34:28,084 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 63 [2025-01-10 06:34:28,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 60 transitions, 150 flow. Second operand has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 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-01-10 06:34:28,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:28,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 63 [2025-01-10 06:34:28,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:28,253 INFO L124 PetriNetUnfolderBase]: 547/1259 cut-off events. [2025-01-10 06:34:28,253 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-01-10 06:34:28,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2176 conditions, 1259 events. 547/1259 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7805 event pairs, 468 based on Foata normal form. 1/1107 useless extension candidates. Maximal degree in co-relation 2157. Up to 864 conditions per place. [2025-01-10 06:34:28,259 INFO L140 encePairwiseOnDemand]: 58/63 looper letters, 25 selfloop transitions, 6 changer transitions 0/59 dead transitions. [2025-01-10 06:34:28,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 59 transitions, 208 flow [2025-01-10 06:34:28,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:34:28,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:34:28,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 200 transitions. [2025-01-10 06:34:28,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5291005291005291 [2025-01-10 06:34:28,261 INFO L175 Difference]: Start difference. First operand has 63 places, 60 transitions, 150 flow. Second operand 6 states and 200 transitions. [2025-01-10 06:34:28,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 59 transitions, 208 flow [2025-01-10 06:34:28,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 59 transitions, 206 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:34:28,262 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 156 flow [2025-01-10 06:34:28,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=156, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2025-01-10 06:34:28,263 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 7 predicate places. [2025-01-10 06:34:28,263 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 156 flow [2025-01-10 06:34:28,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 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-01-10 06:34:28,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:28,263 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-01-10 06:34:28,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 06:34:28,463 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,SelfDestructingSolverStorable8 [2025-01-10 06:34:28,464 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-01-10 06:34:28,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:28,464 INFO L85 PathProgramCache]: Analyzing trace with hash 428540755, now seen corresponding path program 1 times [2025-01-10 06:34:28,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:28,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052350284] [2025-01-10 06:34:28,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:28,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:28,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:34:28,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:34:28,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:28,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:28,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:34:28,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:28,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052350284] [2025-01-10 06:34:28,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052350284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:28,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:28,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:28,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089252815] [2025-01-10 06:34:28,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:28,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:28,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:28,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:28,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:28,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 63 [2025-01-10 06:34:28,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-01-10 06:34:28,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:28,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 63 [2025-01-10 06:34:28,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:28,615 INFO L124 PetriNetUnfolderBase]: 547/1258 cut-off events. [2025-01-10 06:34:28,616 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-01-10 06:34:28,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2178 conditions, 1258 events. 547/1258 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7801 event pairs, 468 based on Foata normal form. 1/1107 useless extension candidates. Maximal degree in co-relation 2153. Up to 867 conditions per place. [2025-01-10 06:34:28,623 INFO L140 encePairwiseOnDemand]: 60/63 looper letters, 26 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2025-01-10 06:34:28,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 58 transitions, 212 flow [2025-01-10 06:34:28,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:28,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:28,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2025-01-10 06:34:28,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5978835978835979 [2025-01-10 06:34:28,624 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 156 flow. Second operand 3 states and 113 transitions. [2025-01-10 06:34:28,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 58 transitions, 212 flow [2025-01-10 06:34:28,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 58 transitions, 190 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-01-10 06:34:28,626 INFO L231 Difference]: Finished difference. Result has 61 places, 58 transitions, 138 flow [2025-01-10 06:34:28,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=61, PETRI_TRANSITIONS=58} [2025-01-10 06:34:28,626 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 2 predicate places. [2025-01-10 06:34:28,627 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 138 flow [2025-01-10 06:34:28,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-01-10 06:34:28,627 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:28,627 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:28,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:34:28,627 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-01-10 06:34:28,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:28,627 INFO L85 PathProgramCache]: Analyzing trace with hash -488603344, now seen corresponding path program 1 times [2025-01-10 06:34:28,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:28,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073038781] [2025-01-10 06:34:28,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:28,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:28,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:34:28,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:34:28,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:28,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:28,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:28,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:28,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073038781] [2025-01-10 06:34:28,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073038781] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:34:28,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404146304] [2025-01-10 06:34:28,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:28,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:34:28,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:34:28,668 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:34:28,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 06:34:28,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:34:28,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:34:28,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:28,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:28,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:34:28,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:34:28,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:28,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:34:28,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:28,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404146304] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:34:28,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:34:28,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-10 06:34:28,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144942816] [2025-01-10 06:34:28,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:34:28,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:34:28,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:28,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:34:28,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:34:28,771 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 63 [2025-01-10 06:34:28,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 58 transitions, 138 flow. Second operand has 10 states, 10 states have (on average 29.4) internal successors, (294), 10 states have internal predecessors, (294), 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-01-10 06:34:28,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:28,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 63 [2025-01-10 06:34:28,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:28,939 INFO L124 PetriNetUnfolderBase]: 547/1262 cut-off events. [2025-01-10 06:34:28,940 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-01-10 06:34:28,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2181 conditions, 1262 events. 547/1262 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7799 event pairs, 468 based on Foata normal form. 2/1113 useless extension candidates. Maximal degree in co-relation 2146. Up to 865 conditions per place. [2025-01-10 06:34:28,948 INFO L140 encePairwiseOnDemand]: 59/63 looper letters, 26 selfloop transitions, 7 changer transitions 0/61 dead transitions. [2025-01-10 06:34:28,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 61 transitions, 219 flow [2025-01-10 06:34:28,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:34:28,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:34:28,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 231 transitions. [2025-01-10 06:34:28,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2025-01-10 06:34:28,950 INFO L175 Difference]: Start difference. First operand has 61 places, 58 transitions, 138 flow. Second operand 7 states and 231 transitions. [2025-01-10 06:34:28,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 61 transitions, 219 flow [2025-01-10 06:34:28,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 61 transitions, 205 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:28,952 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 164 flow [2025-01-10 06:34:28,952 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=164, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2025-01-10 06:34:28,952 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 8 predicate places. [2025-01-10 06:34:28,952 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 164 flow [2025-01-10 06:34:28,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 29.4) internal successors, (294), 10 states have internal predecessors, (294), 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-01-10 06:34:28,953 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:28,953 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:28,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 06:34:29,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-10 06:34:29,159 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-01-10 06:34:29,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:29,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1102816016, now seen corresponding path program 2 times [2025-01-10 06:34:29,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:29,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136697082] [2025-01-10 06:34:29,160 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:34:29,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:29,167 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-10 06:34:29,169 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 15 statements. [2025-01-10 06:34:29,169 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:34:29,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:29,189 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 06:34:29,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:29,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136697082] [2025-01-10 06:34:29,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136697082] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:29,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:29,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:29,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186677345] [2025-01-10 06:34:29,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:29,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:29,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:29,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:29,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:29,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 63 [2025-01-10 06:34:29,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-01-10 06:34:29,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:29,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 63 [2025-01-10 06:34:29,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:29,320 INFO L124 PetriNetUnfolderBase]: 624/1403 cut-off events. [2025-01-10 06:34:29,320 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-01-10 06:34:29,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2418 conditions, 1403 events. 624/1403 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 8616 event pairs, 68 based on Foata normal form. 33/1343 useless extension candidates. Maximal degree in co-relation 2378. Up to 807 conditions per place. [2025-01-10 06:34:29,325 INFO L140 encePairwiseOnDemand]: 60/63 looper letters, 45 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2025-01-10 06:34:29,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 73 transitions, 287 flow [2025-01-10 06:34:29,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:29,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:29,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2025-01-10 06:34:29,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.671957671957672 [2025-01-10 06:34:29,327 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 164 flow. Second operand 3 states and 127 transitions. [2025-01-10 06:34:29,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 73 transitions, 287 flow [2025-01-10 06:34:29,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 73 transitions, 283 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:29,329 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 162 flow [2025-01-10 06:34:29,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2025-01-10 06:34:29,331 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 7 predicate places. [2025-01-10 06:34:29,331 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 162 flow [2025-01-10 06:34:29,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-01-10 06:34:29,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:29,331 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:29,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:34:29,331 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-01-10 06:34:29,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:29,332 INFO L85 PathProgramCache]: Analyzing trace with hash -172441460, now seen corresponding path program 1 times [2025-01-10 06:34:29,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:29,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391452826] [2025-01-10 06:34:29,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:29,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:29,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:34:29,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:34:29,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:29,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:29,386 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 06:34:29,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:29,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391452826] [2025-01-10 06:34:29,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391452826] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:29,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:29,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:29,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958830912] [2025-01-10 06:34:29,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:29,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:29,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:29,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:29,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:29,394 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 63 [2025-01-10 06:34:29,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-01-10 06:34:29,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:29,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 63 [2025-01-10 06:34:29,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:29,481 INFO L124 PetriNetUnfolderBase]: 559/1245 cut-off events. [2025-01-10 06:34:29,482 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2025-01-10 06:34:29,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2236 conditions, 1245 events. 559/1245 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 7255 event pairs, 212 based on Foata normal form. 33/1182 useless extension candidates. Maximal degree in co-relation 2197. Up to 721 conditions per place. [2025-01-10 06:34:29,487 INFO L140 encePairwiseOnDemand]: 60/63 looper letters, 44 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2025-01-10 06:34:29,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 72 transitions, 283 flow [2025-01-10 06:34:29,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:29,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:29,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2025-01-10 06:34:29,489 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-01-10 06:34:29,489 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 162 flow. Second operand 3 states and 126 transitions. [2025-01-10 06:34:29,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 72 transitions, 283 flow [2025-01-10 06:34:29,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 72 transitions, 279 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:29,491 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 160 flow [2025-01-10 06:34:29,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2025-01-10 06:34:29,493 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 6 predicate places. [2025-01-10 06:34:29,493 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 160 flow [2025-01-10 06:34:29,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-01-10 06:34:29,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:29,493 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:29,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:34:29,494 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-01-10 06:34:29,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:29,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1739103485, now seen corresponding path program 1 times [2025-01-10 06:34:29,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:29,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579421432] [2025-01-10 06:34:29,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:29,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:29,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:34:29,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:34:29,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:29,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:29,563 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 06:34:29,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:29,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579421432] [2025-01-10 06:34:29,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579421432] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:29,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:29,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:29,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025792874] [2025-01-10 06:34:29,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:29,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:29,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:29,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:29,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:29,570 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 63 [2025-01-10 06:34:29,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-01-10 06:34:29,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:29,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 63 [2025-01-10 06:34:29,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:29,675 INFO L124 PetriNetUnfolderBase]: 615/1363 cut-off events. [2025-01-10 06:34:29,675 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2025-01-10 06:34:29,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2440 conditions, 1363 events. 615/1363 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 8229 event pairs, 92 based on Foata normal form. 30/1309 useless extension candidates. Maximal degree in co-relation 2401. Up to 750 conditions per place. [2025-01-10 06:34:29,681 INFO L140 encePairwiseOnDemand]: 60/63 looper letters, 44 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2025-01-10 06:34:29,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 70 transitions, 278 flow [2025-01-10 06:34:29,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:29,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:29,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2025-01-10 06:34:29,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-01-10 06:34:29,682 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 160 flow. Second operand 3 states and 126 transitions. [2025-01-10 06:34:29,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 70 transitions, 278 flow [2025-01-10 06:34:29,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 70 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:29,684 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 158 flow [2025-01-10 06:34:29,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2025-01-10 06:34:29,684 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 5 predicate places. [2025-01-10 06:34:29,684 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 158 flow [2025-01-10 06:34:29,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-01-10 06:34:29,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:29,685 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-01-10 06:34:29,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:34:29,685 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-01-10 06:34:29,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:29,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1922391956, now seen corresponding path program 1 times [2025-01-10 06:34:29,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:29,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045385424] [2025-01-10 06:34:29,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:29,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:29,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 06:34:29,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:34:29,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:29,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:29,750 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:29,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:29,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045385424] [2025-01-10 06:34:29,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045385424] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:34:29,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043591096] [2025-01-10 06:34:29,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:29,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:34:29,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:34:29,753 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:34:29,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 06:34:29,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 06:34:29,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:34:29,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:29,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:29,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 06:34:29,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:34:29,833 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:29,833 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:34:29,911 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:29,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043591096] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:34:29,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:34:29,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-01-10 06:34:29,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106723096] [2025-01-10 06:34:29,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:34:29,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 06:34:29,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:29,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 06:34:29,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-01-10 06:34:29,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 63 [2025-01-10 06:34:29,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 158 flow. Second operand has 15 states, 15 states have (on average 29.4) internal successors, (441), 15 states have internal predecessors, (441), 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-01-10 06:34:29,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:29,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 63 [2025-01-10 06:34:29,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:30,088 INFO L124 PetriNetUnfolderBase]: 547/1253 cut-off events. [2025-01-10 06:34:30,088 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-01-10 06:34:30,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2256 conditions, 1253 events. 547/1253 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7645 event pairs, 468 based on Foata normal form. 3/1123 useless extension candidates. Maximal degree in co-relation 2190. Up to 865 conditions per place. [2025-01-10 06:34:30,093 INFO L140 encePairwiseOnDemand]: 59/63 looper letters, 26 selfloop transitions, 13 changer transitions 0/64 dead transitions. [2025-01-10 06:34:30,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 64 transitions, 272 flow [2025-01-10 06:34:30,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 06:34:30,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 06:34:30,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 406 transitions. [2025-01-10 06:34:30,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49572649572649574 [2025-01-10 06:34:30,095 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 158 flow. Second operand 13 states and 406 transitions. [2025-01-10 06:34:30,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 64 transitions, 272 flow [2025-01-10 06:34:30,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 64 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:30,096 INFO L231 Difference]: Finished difference. Result has 77 places, 64 transitions, 231 flow [2025-01-10 06:34:30,096 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=231, PETRI_PLACES=77, PETRI_TRANSITIONS=64} [2025-01-10 06:34:30,097 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 18 predicate places. [2025-01-10 06:34:30,097 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 64 transitions, 231 flow [2025-01-10 06:34:30,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 29.4) internal successors, (441), 15 states have internal predecessors, (441), 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-01-10 06:34:30,097 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:30,097 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 3, 2, 1, 1, 1, 1, 1] [2025-01-10 06:34:30,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 06:34:30,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 06:34:30,299 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-01-10 06:34:30,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:30,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1552118799, now seen corresponding path program 2 times [2025-01-10 06:34:30,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:30,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260562415] [2025-01-10 06:34:30,301 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:34:30,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:30,308 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-10 06:34:30,320 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 06:34:30,320 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:34:30,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:34:30,321 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:34:30,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 06:34:30,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 06:34:30,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:30,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:34:30,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:34:30,339 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:34:30,339 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-01-10 06:34:30,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 15 remaining) [2025-01-10 06:34:30,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 15 remaining) [2025-01-10 06:34:30,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 15 remaining) [2025-01-10 06:34:30,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 15 remaining) [2025-01-10 06:34:30,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 15 remaining) [2025-01-10 06:34:30,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 15 remaining) [2025-01-10 06:34:30,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 15 remaining) [2025-01-10 06:34:30,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 15 remaining) [2025-01-10 06:34:30,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 15 remaining) [2025-01-10 06:34:30,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 15 remaining) [2025-01-10 06:34:30,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 15 remaining) [2025-01-10 06:34:30,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 15 remaining) [2025-01-10 06:34:30,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 15 remaining) [2025-01-10 06:34:30,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 15 remaining) [2025-01-10 06:34:30,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:34:30,340 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2025-01-10 06:34:30,340 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:34:30,340 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 06:34:30,370 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:34:30,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 89 transitions, 196 flow [2025-01-10 06:34:30,377 INFO L124 PetriNetUnfolderBase]: 13/97 cut-off events. [2025-01-10 06:34:30,377 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 06:34:30,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 97 events. 13/97 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 335 event pairs, 0 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 78. Up to 4 conditions per place. [2025-01-10 06:34:30,377 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 89 transitions, 196 flow [2025-01-10 06:34:30,378 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 89 transitions, 196 flow [2025-01-10 06:34:30,379 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:34:30,379 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;@1a4e869b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:34:30,379 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-01-10 06:34:30,380 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:34:30,380 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 06:34:30,380 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:34:30,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:30,380 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 06:34:30,380 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:34:30,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:30,380 INFO L85 PathProgramCache]: Analyzing trace with hash 456230, now seen corresponding path program 1 times [2025-01-10 06:34:30,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:30,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899807830] [2025-01-10 06:34:30,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:30,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:30,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:34:30,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:34:30,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:30,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:30,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:30,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:30,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899807830] [2025-01-10 06:34:30,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899807830] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:30,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:30,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:30,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117565637] [2025-01-10 06:34:30,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:30,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:34:30,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:30,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:34:30,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:34:30,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 89 [2025-01-10 06:34:30,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 89 transitions, 196 flow. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 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-01-10 06:34:30,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:30,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 89 [2025-01-10 06:34:30,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:31,359 INFO L124 PetriNetUnfolderBase]: 8717/15445 cut-off events. [2025-01-10 06:34:31,360 INFO L125 PetriNetUnfolderBase]: For 670/670 co-relation queries the response was YES. [2025-01-10 06:34:31,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27852 conditions, 15445 events. 8717/15445 cut-off events. For 670/670 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 125420 event pairs, 7668 based on Foata normal form. 2506/16439 useless extension candidates. Maximal degree in co-relation 8049. Up to 11969 conditions per place. [2025-01-10 06:34:31,444 INFO L140 encePairwiseOnDemand]: 76/89 looper letters, 40 selfloop transitions, 3 changer transitions 0/84 dead transitions. [2025-01-10 06:34:31,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 84 transitions, 272 flow [2025-01-10 06:34:31,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:34:31,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:34:31,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2025-01-10 06:34:31,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6095505617977528 [2025-01-10 06:34:31,446 INFO L175 Difference]: Start difference. First operand has 83 places, 89 transitions, 196 flow. Second operand 4 states and 217 transitions. [2025-01-10 06:34:31,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 84 transitions, 272 flow [2025-01-10 06:34:31,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 84 transitions, 270 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-10 06:34:31,448 INFO L231 Difference]: Finished difference. Result has 87 places, 84 transitions, 204 flow [2025-01-10 06:34:31,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=204, PETRI_PLACES=87, PETRI_TRANSITIONS=84} [2025-01-10 06:34:31,448 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 4 predicate places. [2025-01-10 06:34:31,448 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 84 transitions, 204 flow [2025-01-10 06:34:31,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 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-01-10 06:34:31,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:31,448 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 06:34:31,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 06:34:31,449 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:34:31,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:31,449 INFO L85 PathProgramCache]: Analyzing trace with hash 707088818, now seen corresponding path program 1 times [2025-01-10 06:34:31,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:31,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542707108] [2025-01-10 06:34:31,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:31,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:31,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:34:31,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:34:31,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:31,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:31,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:31,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:31,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542707108] [2025-01-10 06:34:31,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542707108] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:34:31,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298001262] [2025-01-10 06:34:31,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:31,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:34:31,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:34:31,486 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:34:31,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 06:34:31,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:34:31,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:34:31,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:31,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:31,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:34:31,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:34:31,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:31,556 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:34:31,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298001262] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:31,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:34:31,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 06:34:31,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151924813] [2025-01-10 06:34:31,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:31,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:34:31,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:31,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:34:31,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:34:31,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 89 [2025-01-10 06:34:31,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 84 transitions, 204 flow. Second operand has 6 states, 6 states have (on average 41.833333333333336) internal successors, (251), 6 states have internal predecessors, (251), 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-01-10 06:34:31,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:31,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 89 [2025-01-10 06:34:31,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:32,454 INFO L124 PetriNetUnfolderBase]: 8717/15444 cut-off events. [2025-01-10 06:34:32,454 INFO L125 PetriNetUnfolderBase]: For 376/376 co-relation queries the response was YES. [2025-01-10 06:34:32,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27762 conditions, 15444 events. 8717/15444 cut-off events. For 376/376 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 125437 event pairs, 7668 based on Foata normal form. 1/13933 useless extension candidates. Maximal degree in co-relation 27742. Up to 11964 conditions per place. [2025-01-10 06:34:32,524 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 36 selfloop transitions, 6 changer transitions 0/83 dead transitions. [2025-01-10 06:34:32,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 83 transitions, 284 flow [2025-01-10 06:34:32,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:34:32,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:34:32,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 289 transitions. [2025-01-10 06:34:32,525 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5411985018726592 [2025-01-10 06:34:32,525 INFO L175 Difference]: Start difference. First operand has 87 places, 84 transitions, 204 flow. Second operand 6 states and 289 transitions. [2025-01-10 06:34:32,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 83 transitions, 284 flow [2025-01-10 06:34:32,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 83 transitions, 282 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:34:32,527 INFO L231 Difference]: Finished difference. Result has 90 places, 83 transitions, 210 flow [2025-01-10 06:34:32,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=90, PETRI_TRANSITIONS=83} [2025-01-10 06:34:32,527 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 7 predicate places. [2025-01-10 06:34:32,527 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 83 transitions, 210 flow [2025-01-10 06:34:32,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.833333333333336) internal successors, (251), 6 states have internal predecessors, (251), 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-01-10 06:34:32,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:32,528 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-01-10 06:34:32,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 06:34:32,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:34:32,729 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:34:32,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:32,729 INFO L85 PathProgramCache]: Analyzing trace with hash 444917324, now seen corresponding path program 1 times [2025-01-10 06:34:32,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:32,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441132509] [2025-01-10 06:34:32,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:32,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:32,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:34:32,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:34:32,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:32,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:32,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:34:32,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:32,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441132509] [2025-01-10 06:34:32,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441132509] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:32,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:32,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:32,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766708106] [2025-01-10 06:34:32,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:32,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:32,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:32,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:32,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:32,751 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 89 [2025-01-10 06:34:32,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 83 transitions, 210 flow. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-01-10 06:34:32,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:32,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 89 [2025-01-10 06:34:32,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:33,630 INFO L124 PetriNetUnfolderBase]: 8717/15443 cut-off events. [2025-01-10 06:34:33,631 INFO L125 PetriNetUnfolderBase]: For 381/381 co-relation queries the response was YES. [2025-01-10 06:34:33,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27764 conditions, 15443 events. 8717/15443 cut-off events. For 381/381 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 125452 event pairs, 7668 based on Foata normal form. 1/13933 useless extension candidates. Maximal degree in co-relation 27738. Up to 11967 conditions per place. [2025-01-10 06:34:33,713 INFO L140 encePairwiseOnDemand]: 86/89 looper letters, 37 selfloop transitions, 4 changer transitions 0/82 dead transitions. [2025-01-10 06:34:33,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 82 transitions, 288 flow [2025-01-10 06:34:33,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:33,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:33,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 163 transitions. [2025-01-10 06:34:33,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6104868913857678 [2025-01-10 06:34:33,715 INFO L175 Difference]: Start difference. First operand has 90 places, 83 transitions, 210 flow. Second operand 3 states and 163 transitions. [2025-01-10 06:34:33,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 82 transitions, 288 flow [2025-01-10 06:34:33,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 82 transitions, 266 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-01-10 06:34:33,716 INFO L231 Difference]: Finished difference. Result has 85 places, 82 transitions, 192 flow [2025-01-10 06:34:33,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=85, PETRI_TRANSITIONS=82} [2025-01-10 06:34:33,717 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 2 predicate places. [2025-01-10 06:34:33,717 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 82 transitions, 192 flow [2025-01-10 06:34:33,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-01-10 06:34:33,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:33,717 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:33,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 06:34:33,717 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:34:33,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:33,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1930562846, now seen corresponding path program 1 times [2025-01-10 06:34:33,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:33,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113829299] [2025-01-10 06:34:33,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:33,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:33,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:34:33,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:34:33,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:33,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:33,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:33,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:33,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113829299] [2025-01-10 06:34:33,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113829299] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:34:33,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471432475] [2025-01-10 06:34:33,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:33,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:34:33,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:34:33,754 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:34:33,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 06:34:33,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:34:33,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:34:33,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:33,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:33,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:34:33,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:34:33,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:33,830 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:34:33,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:33,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471432475] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:34:33,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:34:33,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-10 06:34:33,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256399120] [2025-01-10 06:34:33,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:34:33,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:34:33,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:33,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:34:33,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:34:33,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 89 [2025-01-10 06:34:33,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 82 transitions, 192 flow. Second operand has 10 states, 10 states have (on average 42.4) internal successors, (424), 10 states have internal predecessors, (424), 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-01-10 06:34:33,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:33,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 89 [2025-01-10 06:34:33,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:34,728 INFO L124 PetriNetUnfolderBase]: 8717/15447 cut-off events. [2025-01-10 06:34:34,728 INFO L125 PetriNetUnfolderBase]: For 383/383 co-relation queries the response was YES. [2025-01-10 06:34:34,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27767 conditions, 15447 events. 8717/15447 cut-off events. For 383/383 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 125328 event pairs, 7668 based on Foata normal form. 2/13939 useless extension candidates. Maximal degree in co-relation 27731. Up to 11965 conditions per place. [2025-01-10 06:34:34,817 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 37 selfloop transitions, 7 changer transitions 0/85 dead transitions. [2025-01-10 06:34:34,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 85 transitions, 295 flow [2025-01-10 06:34:34,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:34:34,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:34:34,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 333 transitions. [2025-01-10 06:34:34,819 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5345104333868379 [2025-01-10 06:34:34,819 INFO L175 Difference]: Start difference. First operand has 85 places, 82 transitions, 192 flow. Second operand 7 states and 333 transitions. [2025-01-10 06:34:34,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 85 transitions, 295 flow [2025-01-10 06:34:34,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 85 transitions, 281 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:34,821 INFO L231 Difference]: Finished difference. Result has 91 places, 85 transitions, 218 flow [2025-01-10 06:34:34,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=218, PETRI_PLACES=91, PETRI_TRANSITIONS=85} [2025-01-10 06:34:34,822 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 8 predicate places. [2025-01-10 06:34:34,822 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 85 transitions, 218 flow [2025-01-10 06:34:34,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 42.4) internal successors, (424), 10 states have internal predecessors, (424), 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-01-10 06:34:34,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:34,822 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:34,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 06:34:35,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:34:35,027 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:34:35,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:35,028 INFO L85 PathProgramCache]: Analyzing trace with hash -125413534, now seen corresponding path program 2 times [2025-01-10 06:34:35,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:35,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878073752] [2025-01-10 06:34:35,029 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:34:35,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:35,035 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-10 06:34:35,037 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 15 statements. [2025-01-10 06:34:35,037 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:34:35,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:35,061 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 06:34:35,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:35,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878073752] [2025-01-10 06:34:35,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878073752] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:35,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:35,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:35,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001483391] [2025-01-10 06:34:35,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:35,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:35,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:35,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:35,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:35,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 89 [2025-01-10 06:34:35,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 85 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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-01-10 06:34:35,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:35,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 89 [2025-01-10 06:34:35,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:35,994 INFO L124 PetriNetUnfolderBase]: 9720/16898 cut-off events. [2025-01-10 06:34:35,994 INFO L125 PetriNetUnfolderBase]: For 394/394 co-relation queries the response was YES. [2025-01-10 06:34:36,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30454 conditions, 16898 events. 9720/16898 cut-off events. For 394/394 co-relation queries the response was YES. Maximal size of possible extension queue 719. Compared 134393 event pairs, 5096 based on Foata normal form. 333/16037 useless extension candidates. Maximal degree in co-relation 30413. Up to 11097 conditions per place. [2025-01-10 06:34:36,060 INFO L140 encePairwiseOnDemand]: 86/89 looper letters, 67 selfloop transitions, 2 changer transitions 0/108 dead transitions. [2025-01-10 06:34:36,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 108 transitions, 412 flow [2025-01-10 06:34:36,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:36,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:36,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2025-01-10 06:34:36,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.704119850187266 [2025-01-10 06:34:36,065 INFO L175 Difference]: Start difference. First operand has 91 places, 85 transitions, 218 flow. Second operand 3 states and 188 transitions. [2025-01-10 06:34:36,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 108 transitions, 412 flow [2025-01-10 06:34:36,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 108 transitions, 408 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:36,067 INFO L231 Difference]: Finished difference. Result has 90 places, 84 transitions, 216 flow [2025-01-10 06:34:36,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=90, PETRI_TRANSITIONS=84} [2025-01-10 06:34:36,067 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 7 predicate places. [2025-01-10 06:34:36,067 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 84 transitions, 216 flow [2025-01-10 06:34:36,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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-01-10 06:34:36,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:36,067 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:36,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 06:34:36,068 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:34:36,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:36,068 INFO L85 PathProgramCache]: Analyzing trace with hash 407148243, now seen corresponding path program 1 times [2025-01-10 06:34:36,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:36,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33052860] [2025-01-10 06:34:36,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:36,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:36,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:34:36,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:34:36,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:36,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:36,108 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 06:34:36,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:36,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33052860] [2025-01-10 06:34:36,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33052860] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:36,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:36,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:36,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263572855] [2025-01-10 06:34:36,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:36,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:36,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:36,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:36,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:36,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 89 [2025-01-10 06:34:36,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 84 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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-01-10 06:34:36,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:36,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 89 [2025-01-10 06:34:36,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:36,986 INFO L124 PetriNetUnfolderBase]: 8830/15390 cut-off events. [2025-01-10 06:34:36,986 INFO L125 PetriNetUnfolderBase]: For 993/993 co-relation queries the response was YES. [2025-01-10 06:34:37,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28382 conditions, 15390 events. 8830/15390 cut-off events. For 993/993 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 120486 event pairs, 4592 based on Foata normal form. 333/14631 useless extension candidates. Maximal degree in co-relation 28342. Up to 9901 conditions per place. [2025-01-10 06:34:37,064 INFO L140 encePairwiseOnDemand]: 86/89 looper letters, 66 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2025-01-10 06:34:37,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 107 transitions, 408 flow [2025-01-10 06:34:37,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:37,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:37,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2025-01-10 06:34:37,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.700374531835206 [2025-01-10 06:34:37,066 INFO L175 Difference]: Start difference. First operand has 90 places, 84 transitions, 216 flow. Second operand 3 states and 187 transitions. [2025-01-10 06:34:37,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 107 transitions, 408 flow [2025-01-10 06:34:37,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 107 transitions, 404 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:37,068 INFO L231 Difference]: Finished difference. Result has 89 places, 83 transitions, 214 flow [2025-01-10 06:34:37,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=89, PETRI_TRANSITIONS=83} [2025-01-10 06:34:37,069 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 6 predicate places. [2025-01-10 06:34:37,069 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 83 transitions, 214 flow [2025-01-10 06:34:37,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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-01-10 06:34:37,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:37,069 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:37,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 06:34:37,069 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:34:37,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:37,070 INFO L85 PathProgramCache]: Analyzing trace with hash 379088061, now seen corresponding path program 1 times [2025-01-10 06:34:37,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:37,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014798229] [2025-01-10 06:34:37,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:37,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:37,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:34:37,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:34:37,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:37,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:37,154 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:37,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:37,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014798229] [2025-01-10 06:34:37,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014798229] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:34:37,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338206893] [2025-01-10 06:34:37,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:37,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:34:37,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:34:37,157 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:34:37,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 06:34:37,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:34:37,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:34:37,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:37,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:37,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 06:34:37,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:34:37,256 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:37,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:34:37,321 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:37,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338206893] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:34:37,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:34:37,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-01-10 06:34:37,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183955018] [2025-01-10 06:34:37,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:34:37,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 06:34:37,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:37,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 06:34:37,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-01-10 06:34:37,335 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 89 [2025-01-10 06:34:37,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 83 transitions, 214 flow. Second operand has 15 states, 15 states have (on average 42.46666666666667) internal successors, (637), 15 states have internal predecessors, (637), 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-01-10 06:34:37,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:37,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 89 [2025-01-10 06:34:37,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:38,580 INFO L124 PetriNetUnfolderBase]: 8717/15454 cut-off events. [2025-01-10 06:34:38,580 INFO L125 PetriNetUnfolderBase]: For 997/997 co-relation queries the response was YES. [2025-01-10 06:34:38,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28464 conditions, 15454 events. 8717/15454 cut-off events. For 997/997 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 125320 event pairs, 7668 based on Foata normal form. 3/13949 useless extension candidates. Maximal degree in co-relation 28397. Up to 11965 conditions per place. [2025-01-10 06:34:38,630 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 37 selfloop transitions, 13 changer transitions 0/89 dead transitions. [2025-01-10 06:34:38,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 89 transitions, 350 flow [2025-01-10 06:34:38,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 06:34:38,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 06:34:38,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 586 transitions. [2025-01-10 06:34:38,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5064822817631807 [2025-01-10 06:34:38,632 INFO L175 Difference]: Start difference. First operand has 89 places, 83 transitions, 214 flow. Second operand 13 states and 586 transitions. [2025-01-10 06:34:38,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 89 transitions, 350 flow [2025-01-10 06:34:38,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 89 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:38,637 INFO L231 Difference]: Finished difference. Result has 102 places, 89 transitions, 287 flow [2025-01-10 06:34:38,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=287, PETRI_PLACES=102, PETRI_TRANSITIONS=89} [2025-01-10 06:34:38,637 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 19 predicate places. [2025-01-10 06:34:38,637 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 89 transitions, 287 flow [2025-01-10 06:34:38,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 42.46666666666667) internal successors, (637), 15 states have internal predecessors, (637), 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-01-10 06:34:38,638 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:38,638 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:38,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 06:34:38,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:34:38,839 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:34:38,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:38,839 INFO L85 PathProgramCache]: Analyzing trace with hash 436448305, now seen corresponding path program 2 times [2025-01-10 06:34:38,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:38,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700918250] [2025-01-10 06:34:38,839 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:34:38,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:38,845 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-10 06:34:38,851 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 27 statements. [2025-01-10 06:34:38,851 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:34:38,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:38,872 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-01-10 06:34:38,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:38,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700918250] [2025-01-10 06:34:38,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700918250] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:38,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:38,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:38,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339633327] [2025-01-10 06:34:38,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:38,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:38,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:38,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:38,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:38,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 89 [2025-01-10 06:34:38,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 89 transitions, 287 flow. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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-01-10 06:34:38,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:38,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 89 [2025-01-10 06:34:38,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:39,663 INFO L124 PetriNetUnfolderBase]: 9781/17102 cut-off events. [2025-01-10 06:34:39,663 INFO L125 PetriNetUnfolderBase]: For 429/429 co-relation queries the response was YES. [2025-01-10 06:34:39,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30689 conditions, 17102 events. 9781/17102 cut-off events. For 429/429 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 136349 event pairs, 2972 based on Foata normal form. 330/16357 useless extension candidates. Maximal degree in co-relation 30602. Up to 11040 conditions per place. [2025-01-10 06:34:39,753 INFO L140 encePairwiseOnDemand]: 86/89 looper letters, 72 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2025-01-10 06:34:39,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 111 transitions, 484 flow [2025-01-10 06:34:39,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:39,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:39,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2025-01-10 06:34:39,754 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.700374531835206 [2025-01-10 06:34:39,754 INFO L175 Difference]: Start difference. First operand has 102 places, 89 transitions, 287 flow. Second operand 3 states and 187 transitions. [2025-01-10 06:34:39,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 111 transitions, 484 flow [2025-01-10 06:34:39,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 111 transitions, 474 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-01-10 06:34:39,756 INFO L231 Difference]: Finished difference. Result has 99 places, 88 transitions, 279 flow [2025-01-10 06:34:39,756 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=279, PETRI_PLACES=99, PETRI_TRANSITIONS=88} [2025-01-10 06:34:39,756 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 16 predicate places. [2025-01-10 06:34:39,756 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 88 transitions, 279 flow [2025-01-10 06:34:39,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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-01-10 06:34:39,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:39,757 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:39,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 06:34:39,757 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:34:39,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:39,757 INFO L85 PathProgramCache]: Analyzing trace with hash 644996093, now seen corresponding path program 1 times [2025-01-10 06:34:39,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:39,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899673748] [2025-01-10 06:34:39,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:39,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:39,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 06:34:39,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 06:34:39,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:39,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:39,821 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-01-10 06:34:39,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:39,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899673748] [2025-01-10 06:34:39,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899673748] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:39,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:39,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:39,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66571865] [2025-01-10 06:34:39,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:39,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:39,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:39,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:39,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:39,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 89 [2025-01-10 06:34:39,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 88 transitions, 279 flow. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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-01-10 06:34:39,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:39,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 89 [2025-01-10 06:34:39,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:40,770 INFO L124 PetriNetUnfolderBase]: 8891/15672 cut-off events. [2025-01-10 06:34:40,770 INFO L125 PetriNetUnfolderBase]: For 928/928 co-relation queries the response was YES. [2025-01-10 06:34:40,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28695 conditions, 15672 events. 8891/15672 cut-off events. For 928/928 co-relation queries the response was YES. Maximal size of possible extension queue 660. Compared 123653 event pairs, 2732 based on Foata normal form. 330/15005 useless extension candidates. Maximal degree in co-relation 28612. Up to 9850 conditions per place. [2025-01-10 06:34:40,853 INFO L140 encePairwiseOnDemand]: 86/89 looper letters, 71 selfloop transitions, 2 changer transitions 0/110 dead transitions. [2025-01-10 06:34:40,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 110 transitions, 474 flow [2025-01-10 06:34:40,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:40,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:40,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2025-01-10 06:34:40,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6966292134831461 [2025-01-10 06:34:40,854 INFO L175 Difference]: Start difference. First operand has 99 places, 88 transitions, 279 flow. Second operand 3 states and 186 transitions. [2025-01-10 06:34:40,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 110 transitions, 474 flow [2025-01-10 06:34:40,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 110 transitions, 470 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:40,857 INFO L231 Difference]: Finished difference. Result has 98 places, 87 transitions, 277 flow [2025-01-10 06:34:40,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=277, PETRI_PLACES=98, PETRI_TRANSITIONS=87} [2025-01-10 06:34:40,857 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 15 predicate places. [2025-01-10 06:34:40,857 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 87 transitions, 277 flow [2025-01-10 06:34:40,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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-01-10 06:34:40,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:40,858 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:40,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 06:34:40,858 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:34:40,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:40,858 INFO L85 PathProgramCache]: Analyzing trace with hash 2144331445, now seen corresponding path program 1 times [2025-01-10 06:34:40,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:40,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951390000] [2025-01-10 06:34:40,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:40,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:40,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 06:34:40,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 06:34:40,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:40,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:40,964 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-01-10 06:34:40,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:40,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951390000] [2025-01-10 06:34:40,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951390000] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:40,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:40,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:34:40,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151854574] [2025-01-10 06:34:40,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:40,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:34:40,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:40,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:34:40,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:34:40,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 89 [2025-01-10 06:34:40,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 87 transitions, 277 flow. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 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-01-10 06:34:40,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:40,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 89 [2025-01-10 06:34:40,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:41,790 INFO L124 PetriNetUnfolderBase]: 9669/16553 cut-off events. [2025-01-10 06:34:41,791 INFO L125 PetriNetUnfolderBase]: For 1016/1016 co-relation queries the response was YES. [2025-01-10 06:34:41,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30871 conditions, 16553 events. 9669/16553 cut-off events. For 1016/1016 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 129938 event pairs, 4088 based on Foata normal form. 333/15575 useless extension candidates. Maximal degree in co-relation 30788. Up to 8705 conditions per place. [2025-01-10 06:34:41,908 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 95 selfloop transitions, 4 changer transitions 0/134 dead transitions. [2025-01-10 06:34:41,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 134 transitions, 597 flow [2025-01-10 06:34:41,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:34:41,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:34:41,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2025-01-10 06:34:41,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7106741573033708 [2025-01-10 06:34:41,909 INFO L175 Difference]: Start difference. First operand has 98 places, 87 transitions, 277 flow. Second operand 4 states and 253 transitions. [2025-01-10 06:34:41,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 134 transitions, 597 flow [2025-01-10 06:34:41,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 134 transitions, 585 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:41,918 INFO L231 Difference]: Finished difference. Result has 98 places, 86 transitions, 279 flow [2025-01-10 06:34:41,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=279, PETRI_PLACES=98, PETRI_TRANSITIONS=86} [2025-01-10 06:34:41,918 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 15 predicate places. [2025-01-10 06:34:41,918 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 86 transitions, 279 flow [2025-01-10 06:34:41,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 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-01-10 06:34:41,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:41,918 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:41,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 06:34:41,919 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:34:41,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:41,919 INFO L85 PathProgramCache]: Analyzing trace with hash 2049765870, now seen corresponding path program 1 times [2025-01-10 06:34:41,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:41,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764959363] [2025-01-10 06:34:41,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:41,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:41,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 06:34:41,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 06:34:41,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:41,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:41,981 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-01-10 06:34:41,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:41,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764959363] [2025-01-10 06:34:41,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764959363] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:41,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:41,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:34:41,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297654067] [2025-01-10 06:34:41,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:41,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:34:41,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:41,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:34:41,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:34:41,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 89 [2025-01-10 06:34:41,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 86 transitions, 279 flow. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 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-01-10 06:34:41,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:41,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 89 [2025-01-10 06:34:41,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:43,608 INFO L124 PetriNetUnfolderBase]: 17141/29572 cut-off events. [2025-01-10 06:34:43,609 INFO L125 PetriNetUnfolderBase]: For 2105/2105 co-relation queries the response was YES. [2025-01-10 06:34:43,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55660 conditions, 29572 events. 17141/29572 cut-off events. For 2105/2105 co-relation queries the response was YES. Maximal size of possible extension queue 1145. Compared 253852 event pairs, 8468 based on Foata normal form. 333/28150 useless extension candidates. Maximal degree in co-relation 55577. Up to 13507 conditions per place. [2025-01-10 06:34:43,804 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 104 selfloop transitions, 4 changer transitions 0/143 dead transitions. [2025-01-10 06:34:43,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 143 transitions, 635 flow [2025-01-10 06:34:43,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:34:43,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:34:43,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2025-01-10 06:34:43,805 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7359550561797753 [2025-01-10 06:34:43,805 INFO L175 Difference]: Start difference. First operand has 98 places, 86 transitions, 279 flow. Second operand 4 states and 262 transitions. [2025-01-10 06:34:43,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 143 transitions, 635 flow [2025-01-10 06:34:43,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 143 transitions, 621 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:34:43,845 INFO L231 Difference]: Finished difference. Result has 100 places, 89 transitions, 298 flow [2025-01-10 06:34:43,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=298, PETRI_PLACES=100, PETRI_TRANSITIONS=89} [2025-01-10 06:34:43,846 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 17 predicate places. [2025-01-10 06:34:43,847 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 89 transitions, 298 flow [2025-01-10 06:34:43,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 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-01-10 06:34:43,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:43,847 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:43,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-10 06:34:43,847 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:34:43,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:43,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1293747759, now seen corresponding path program 1 times [2025-01-10 06:34:43,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:43,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766635573] [2025-01-10 06:34:43,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:43,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:43,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:34:43,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:34:43,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:43,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:43,908 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-01-10 06:34:43,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:43,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766635573] [2025-01-10 06:34:43,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766635573] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:43,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:43,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:43,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073400448] [2025-01-10 06:34:43,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:43,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:43,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:43,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:43,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:43,914 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 89 [2025-01-10 06:34:43,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 89 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-01-10 06:34:43,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:43,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 89 [2025-01-10 06:34:43,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:45,506 INFO L124 PetriNetUnfolderBase]: 17907/31481 cut-off events. [2025-01-10 06:34:45,506 INFO L125 PetriNetUnfolderBase]: For 4618/4861 co-relation queries the response was YES. [2025-01-10 06:34:45,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59735 conditions, 31481 events. 17907/31481 cut-off events. For 4618/4861 co-relation queries the response was YES. Maximal size of possible extension queue 1179. Compared 277917 event pairs, 3220 based on Foata normal form. 540/30372 useless extension candidates. Maximal degree in co-relation 59650. Up to 18630 conditions per place. [2025-01-10 06:34:45,690 INFO L140 encePairwiseOnDemand]: 86/89 looper letters, 77 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2025-01-10 06:34:45,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 113 transitions, 523 flow [2025-01-10 06:34:45,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:45,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:45,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2025-01-10 06:34:45,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6966292134831461 [2025-01-10 06:34:45,691 INFO L175 Difference]: Start difference. First operand has 100 places, 89 transitions, 298 flow. Second operand 3 states and 186 transitions. [2025-01-10 06:34:45,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 113 transitions, 523 flow [2025-01-10 06:34:45,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 113 transitions, 517 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:34:45,695 INFO L231 Difference]: Finished difference. Result has 100 places, 88 transitions, 297 flow [2025-01-10 06:34:45,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=297, PETRI_PLACES=100, PETRI_TRANSITIONS=88} [2025-01-10 06:34:45,695 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 17 predicate places. [2025-01-10 06:34:45,695 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 88 transitions, 297 flow [2025-01-10 06:34:45,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-01-10 06:34:45,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:45,696 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 4, 3, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:45,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-10 06:34:45,696 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:34:45,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:45,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1451449836, now seen corresponding path program 1 times [2025-01-10 06:34:45,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:45,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56283138] [2025-01-10 06:34:45,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:45,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:45,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 06:34:45,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 06:34:45,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:45,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:34:45,707 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:34:45,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 06:34:45,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 06:34:45,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:45,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:34:45,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:34:45,718 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:34:45,719 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 19 remaining) [2025-01-10 06:34:45,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 19 remaining) [2025-01-10 06:34:45,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 19 remaining) [2025-01-10 06:34:45,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 19 remaining) [2025-01-10 06:34:45,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 19 remaining) [2025-01-10 06:34:45,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 19 remaining) [2025-01-10 06:34:45,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 19 remaining) [2025-01-10 06:34:45,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 19 remaining) [2025-01-10 06:34:45,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 19 remaining) [2025-01-10 06:34:45,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 19 remaining) [2025-01-10 06:34:45,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 19 remaining) [2025-01-10 06:34:45,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 19 remaining) [2025-01-10 06:34:45,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 19 remaining) [2025-01-10 06:34:45,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 19 remaining) [2025-01-10 06:34:45,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 19 remaining) [2025-01-10 06:34:45,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 19 remaining) [2025-01-10 06:34:45,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 19 remaining) [2025-01-10 06:34:45,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 19 remaining) [2025-01-10 06:34:45,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 19 remaining) [2025-01-10 06:34:45,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-10 06:34:45,719 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:45,721 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:34:45,721 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-10 06:34:45,743 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:34:45,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 115 transitions, 258 flow [2025-01-10 06:34:45,751 INFO L124 PetriNetUnfolderBase]: 17/126 cut-off events. [2025-01-10 06:34:45,751 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-10 06:34:45,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 126 events. 17/126 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 480 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 105. Up to 5 conditions per place. [2025-01-10 06:34:45,752 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 115 transitions, 258 flow [2025-01-10 06:34:45,753 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 115 transitions, 258 flow [2025-01-10 06:34:45,755 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:34:45,756 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;@1a4e869b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:34:45,756 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-01-10 06:34:45,756 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:34:45,756 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 06:34:45,756 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:34:45,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:45,756 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 06:34:45,757 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-01-10 06:34:45,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:45,757 INFO L85 PathProgramCache]: Analyzing trace with hash 570425, now seen corresponding path program 1 times [2025-01-10 06:34:45,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:45,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389440313] [2025-01-10 06:34:45,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:45,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:45,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:34:45,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:34:45,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:45,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:45,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:45,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:45,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389440313] [2025-01-10 06:34:45,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389440313] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:45,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:45,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:45,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100327101] [2025-01-10 06:34:45,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:45,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:34:45,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:45,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:34:45,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:34:45,780 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 115 [2025-01-10 06:34:45,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 115 transitions, 258 flow. Second operand has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 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-01-10 06:34:45,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:45,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 115 [2025-01-10 06:34:45,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:56,858 INFO L124 PetriNetUnfolderBase]: 120365/186035 cut-off events. [2025-01-10 06:34:56,858 INFO L125 PetriNetUnfolderBase]: For 11610/11610 co-relation queries the response was YES. [2025-01-10 06:34:57,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344443 conditions, 186035 events. 120365/186035 cut-off events. For 11610/11610 co-relation queries the response was YES. Maximal size of possible extension queue 6212. Compared 1711137 event pairs, 106668 based on Foata normal form. 34911/206029 useless extension candidates. Maximal degree in co-relation 27954. Up to 152969 conditions per place. [2025-01-10 06:34:58,064 INFO L140 encePairwiseOnDemand]: 100/115 looper letters, 51 selfloop transitions, 3 changer transitions 0/108 dead transitions. [2025-01-10 06:34:58,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 108 transitions, 352 flow [2025-01-10 06:34:58,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:34:58,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:34:58,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 282 transitions. [2025-01-10 06:34:58,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6130434782608696 [2025-01-10 06:34:58,065 INFO L175 Difference]: Start difference. First operand has 107 places, 115 transitions, 258 flow. Second operand 4 states and 282 transitions. [2025-01-10 06:34:58,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 108 transitions, 352 flow [2025-01-10 06:34:58,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 108 transitions, 346 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-01-10 06:34:58,071 INFO L231 Difference]: Finished difference. Result has 111 places, 108 transitions, 258 flow [2025-01-10 06:34:58,071 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=258, PETRI_PLACES=111, PETRI_TRANSITIONS=108} [2025-01-10 06:34:58,071 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 4 predicate places. [2025-01-10 06:34:58,072 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 108 transitions, 258 flow [2025-01-10 06:34:58,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 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-01-10 06:34:58,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:58,072 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 06:34:58,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-10 06:34:58,072 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-01-10 06:34:58,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:58,072 INFO L85 PathProgramCache]: Analyzing trace with hash -185781038, now seen corresponding path program 1 times [2025-01-10 06:34:58,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:58,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077288216] [2025-01-10 06:34:58,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:58,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:58,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:34:58,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:34:58,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:58,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:58,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:58,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:58,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077288216] [2025-01-10 06:34:58,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077288216] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:34:58,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158358704] [2025-01-10 06:34:58,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:58,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:34:58,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:34:58,113 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:34:58,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 06:34:58,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:34:58,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:34:58,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:58,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:58,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:34:58,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:34:58,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:58,202 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:34:58,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158358704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:58,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:34:58,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 06:34:58,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829510801] [2025-01-10 06:34:58,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:58,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:34:58,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:58,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:34:58,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:34:58,209 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 115 [2025-01-10 06:34:58,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 108 transitions, 258 flow. Second operand has 6 states, 6 states have (on average 54.833333333333336) internal successors, (329), 6 states have internal predecessors, (329), 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-01-10 06:34:58,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:58,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 115 [2025-01-10 06:34:58,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand